{"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\"\u003eEry is interested in graph theory, today he ask BrotherK a problem about it: Given you a undirected graph with $N$ vertexes and $M$ edges, you can select a vertex as your starting point, then you need to walk in the graph along edges. However, you can\u0027t pass a edge more than once, even opposite direction is forbidden. At the end, you should come back to the starting point. Assume you has passed $X$ edges, there are two questions:\u003cbr\u003e\u003cbr\u003eQuestion 1: Can $X$ be a odd number ?\u003cbr\u003e\u003cbr\u003eQuestion 2: Can $X$ be a even number ?\u003cbr\u003e\u003cbr\u003e(note: you must walk, so $X$ can\u0027t be 0)\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains a single integer $T$, indicating the number of test cases.\u003cbr\u003e\u003cbr\u003eEach test case begins with two integer $N,~M$, indicating the number of vertexes and the number of edges. Following $M$ lines, each line contains two integers $U_i,~V_i$, indicating there are a edge between vertex $U_i$ and vertex $V_i$.\u003cbr\u003e\u003cbr\u003e$T$ is about 30\u003cbr\u003e\u003cbr\u003e$1~\\le~N~\\le~100000$\u003cbr\u003e\u003cbr\u003e$0~\\le~M~\\le~300000$\u003cbr\u003e\u003cbr\u003e$1~\\le~U_i, V_i~\\le~N$\u003cbr\u003e\u003cbr\u003e$U_i$ will not equal to $V_i$\u003cbr\u003e\u003cbr\u003eThere is at most one edge between any pair of vertex."}},{"title":"Output","value":{"format":"HTML","content":"For each test, print two lines.\u003cbr\u003e\u003cbr\u003eThe first line contains \"YES\" or \"NO\" for question 1. \u003cbr\u003e\u003cbr\u003eThe second line contains \"YES\" or \"NO\" for question 2."}},{"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\u003e3\r\n1 0\r\n3 3\r\n1 2\r\n2 3\r\n3 1\r\n4 4\r\n1 2\r\n2 3\r\n3 4\r\n4 1\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eNO\r\nNO\r\nYES\r\nNO\r\nNO\r\nYES\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"If you need a larger stack size, \u003cbr\u003eplease use #pragma comment(linker, \"/STACK:102400000,102400000\") and submit your solution using C++."}}]}