{"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\u003e\"Ashraf\" and \"Ayman\" created a new game made specifically for \"Mo\u0027aa\", \"Hassanen\" and \"Emad\" who solved 7 problems in the last contest, They made a bet that two of WRL team will solve this problem.\u003c/p\u003e\n\u003cp\u003eThe game is very simple:\u003c/p\u003e\n\u003cp\u003eThere are n boxes numbered from 1 to n and we can put any boxes inside any other box.\u003c/p\u003e\n\u003cp\u003eThe rules:\u003c/p\u003e\n\u003cp\u003eYou can remove any box that does not have any boxes inside it, There is a special box numbered x. The player who removes this box wins.\u003c/p\u003e\n\u003cp\u003eIf the player who plays first win print \"Ayush\" else print \"Ashish\" if both players plays optimally\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line of the input contains a single integer t (1≤t≤10) — the number of testcases. The description of the test cases follows.\u003c/p\u003e\n\n\u003cp\u003eThe first line of each testcase contains two integers n and x (1≤n≤1000,1≤x≤n) — the number of boxes and the special box respectively.\u003c/p\u003e\n\n\u003cp\u003eEach of the next n−1 lines contain two integers b1, b2 (1≤b1,b2≤n, b1≠b2), meaning that b2 is inside b1 or b1 is inside b2.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor every test case, if Ayman wins the game, print \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAyush\u003c/span\u003e\", otherwise print \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAshish\u003c/span\u003e\" (without quotes).\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 Input\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 Output\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 Input\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 Output\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":"\u003cp\u003eFor the 1st test case, Ayush can only remove box 2 or 3, after which box 1 becomes empty and Ashish can remove it in his turn.\u003c/p\u003e\n\u003cp\u003eFor the 2nd test case, Ayush can remove box 2 in the first move itself.\u003c/p\u003e"}}]}