{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eProfessor Alex will organize students to attend an academic conference.\u003c/p\u003e\u003cp\u003eAlex has $$$n$$$ excellent students, and he decides to select some of them (possibly none) to attend the conference. They form a group. Some pairs of them are friends.\u003c/p\u003e\u003cp\u003eThe friendly value of the group is initially $$$0$$$. For each couple of friends $$$(x,y)$$$, if both of them attend the conference, the friendly value of the group will increase $$$1$$$, and if only one of them attends the conference, the friendly value of the group will decrease $$$1$$$. If $$$k$$$ students attend the conference, the friendly value of the group will decrease $$$k$$$.\u003c/p\u003e\u003cp\u003eAlex wants to make the group more friendly. Please output the maximum friendly value of the group.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line of the input gives the number of test cases, $$$T\\ (1 \\le T \\le 10^4)$$$. $$$T$$$ test cases follow.\u003c/p\u003e\u003cp\u003eFor each test case, the first line contains two integers $$$n\\ (1 \\le n \\le 3 \\times 10^5)$$$ and $$$m\\ (1 \\le m \\le 10^6)$$$, where $$$n$$$ is the number of students and $$$m$$$ is the number of couples of friends.\u003c/p\u003e\u003cp\u003eEach of the following $$$m$$$ lines contains two integers $$$x_i,y_i\\ (1 \\le x_i ,y_i \\le n, x_i \\not\u003d y_i)$$$, representing student $$$x_i$$$ and student $$$y_i$$$ are friends. It guaranteed that unordered pairs $$$(x_i,y_i)$$$ are distinct.\u003c/p\u003e\u003cp\u003eThe sum of $$$n$$$ in all test cases doesn\u0027t exceed $$$10^6$$$, and the sum of $$$m$$$ in all test cases doesn\u0027t exceed $$$2 \\times 10^6$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, output one line containing \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eCase #x: y\u003c/span\u003e\", where $$$\\texttt{x}$$$ is the test case number (starting from $$$1$$$), and $$$\\texttt{y}$$$ is the maximum friendly value of the group.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n4 5\n1 2\n1 3\n1 4\n2 3\n3 4\n2 1\n1 2\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 1\nCase #2: 0\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}