{"trustable":true,"prependHtml":"\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 async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eSoda has a bipartite graph with $n$ vertices and $m$ undirected edges. Now he wants to make the graph become a complete bipartite graph with most edges by adding some extra edges. Soda needs you to tell him the maximum number of edges he can add.\u003cbr\u003e\u003cbr\u003eNote: There must be at most one edge between any pair of vertices both in the new graph and old graph.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"There are multiple test cases. The first line of input contains an integer $T$ $(1 \\le T \\le 100)$, indicating the number of test cases. For each test case:\u003cbr\u003e\u003cbr\u003eThe first line contains two integers $n$ and $m$, $(2 \\le n \\le 10000, 0 \\le m \\le 100000)$.\u003cbr\u003e\u003cbr\u003eEach of the next $m$ lines contains two integer $u, v$ $(1 \\le u, v \\le n, v \\ne u)$ which means there\u0027s an undirected edge between vertex $u$ and vertex $v$.\u003cbr\u003e\u003cbr\u003eThere\u0027s at most one edge between any pair of vertices. Most test cases are small."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output the maximum number of edges Soda can add."}},{"title":"Sample","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\r\n4 2\r\n1 2\r\n2 3\r\n4 4\r\n1 2\r\n1 4\r\n2 3\r\n3 4\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n0\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}