{"trustable":false,"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\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eTazim created an undirected connected graph with \u003cb\u003en\u003c/b\u003e nodes and \u003cb\u003e n-1 \u003c/b\u003e edges which has \u003cb\u003e no cycle \u003c/b\u003e. He made a game on this graph which can be played by two players.\u003c/p\u003e\n\nThe rule of the game is simple. In each turn a player can make the following move:\n\u003cul\u003e\n \u003cli\u003eSelect any node that has degree less than or equal to 1 ( Leafnode) from the graph and remove it together with any edge that has this node as one of its endpoints. \u003c/li\u003e\n\u003cli\u003e If any player removes the node labeled with \u003cb\u003e X \u003c/b\u003e he will win the game.\n\u003c/ul\u003e\n\n\u003cp\u003eAyush and Ashish two friends of Tazim wants to play the game. As a good problem solver Tazim\u0027s asked you to determine the winner before the game.\u003c/p\u003e\n\n\n\u003cp\u003e\u003cb\u003eAyush moves first \u003c/b\u003eand both players play Optimally who will be the winner?\u003c/p\u003e\n\u003cp\u003eDegree of a node is the number of nodes connected connected to it by and edge. \u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line of the input contains a single integer $$$t$$$ $$$(1 \\leq t \\leq 10)$$$\u0026nbsp;— the number of testcases. \u003c/p\u003e\n\u003cp\u003eThe first line of each testcase contains two integers $$$n$$$ and $$$x$$$ $$$(1\\leq n \\leq 1000, 1 \\leq x \\leq n)$$$\u0026nbsp;— the number of nodes in the tree and the labeled node respectively.\u003c/p\u003e\n\u003cp\u003eEach of the next $$$n-1$$$ lines contain two integers $$$u$$$, $$$v$$$ $$$(1 \\leq u, v \\leq n, \\text{ } u \\ne v)$$$, means an edge between nodes $$$u$$$ and $$$v$$$ in the graph.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003ePrint the name of the winner of the game \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAyush\u003c/span\u003e\", or \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAshish\u003c/span\u003e\".\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003cdiv class\u003d\"sample-test\"\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Sample Input - 1\n \u003c/div\u003e\n \u003cpre\u003e1\n3 1\n2 1\n3 1\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Sample Output - 1\n \u003c/div\u003e\n \u003cpre\u003eAshish\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Sample Input - 2\n \u003c/div\u003e\n \u003cpre\u003e1\n3 2\n1 2\n1 3\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Sample Output - 2\n \u003c/div\u003e\n \u003cpre\u003eAyush\n\u003c/pre\u003e\n \u003c/div\u003e\n\u003c/div\u003e"}},{"title":"Note","value":{"format":"HTML","content":"In the first case, 2nd player will always win as he has a chance to remove the node X."}}]}