{"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\"\u003eAs we know, Tsuyuri Kumin likes sleeping in Eastest magical day sleep group\u0027s summer. But Rikka wants Kumin to play games with her. So she comes up with one problem:\u003cbr\u003e\u003cbr\u003eHere is an undirected graph $G$ with $n$ vertices and $m$ edges. Now you need to delete $m-n$ edges and to make sure that the remain graph is connected. Rikka wants you to tell her the number of ways to choose the edges.\u003cbr\u003e\u003cbr\u003eKumin wants to go to sleep, so she asks you to answer this question. Can you help her?\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"There are at most 100 testcases,and there are no more 5 testcases with $n \\geq 10$. \u003cbr\u003e\u003cbr\u003eFor each test case, the first line contains two integers $n, m\\ (1 \\leq n \\leq 16, n \\leq m \\leq \\frac{n(n-1)}{2})$.\u003cbr\u003e\u003cbr\u003eThen $m$ lines follows. Each of them contains two integers $u_i,v_i$, meaning that there is an edge between $u_i$ and $v_i$. It is guaranteed that the graph doesn\u0027t contain self loops or multiple edges."}},{"title":"Output","value":{"format":"HTML","content":"For each testcase print a single integer - the number of ways to choose the edges. The answer may be very large, so you only need to print the answer modulo 998244353."}},{"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\u003e4 5\r\n1 2\r\n2 3\r\n3 4\r\n4 1\r\n1 3\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e5\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}