{"trustable":true,"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\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eUtkarsh is forced to play yet another one of Ashish\u0027s games. The game progresses turn by turn and as usual, Ashish moves \u003cspan class\u003d\"tex-font-style-bf\"\u003efirst\u003c/span\u003e.\u003c/p\u003e\u003cp\u003eConsider the 2D plane. There is a token which is initially at \u003cspan class\u003d\"tex-font-style-bf\"\u003e$$$(0,0)$$$\u003c/span\u003e. In one move a player must increase either the $$$x$$$ coordinate or the $$$y$$$ coordinate of the token by \u003cspan class\u003d\"tex-font-style-bf\"\u003eexactly\u003c/span\u003e $$$k$$$. In doing so, the player must ensure that the token stays within a (Euclidean) distance $$$d$$$ from $$$(0,0)$$$.\u003c/p\u003e\u003cp\u003eIn other words, if after a move the coordinates of the token are $$$(p,q)$$$, then $$$p^2 + q^2 \\leq d^2$$$ must hold.\u003c/p\u003e\u003cp\u003eThe game ends when a player is unable to make a move. It can be shown that the game will end in a finite number of moves. If both players play optimally, determine who will win.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains a single integer $$$t$$$ ($$$1 \\leq t \\leq 100$$$)\u0026nbsp;— the number of test cases.\u003c/p\u003e\u003cp\u003eThe only line of each test case contains two space separated integers $$$d$$$ ($$$1 \\leq d \\leq 10^5$$$) and $$$k$$$ ($$$1 \\leq k \\leq d$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, if Ashish wins the game, print \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eAshish\u003c/span\u003e\", otherwise print \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eUtkarsh\u003c/span\u003e\" (without the quotes).\u003c/p\u003e"}},{"title":"Examples","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\u003e5\n2 1\n5 2\n10 3\n25 4\n15441 33\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eUtkarsh\nAshish\nUtkarsh\nUtkarsh\nAshish\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first test case, one possible sequence of moves can be\u003c/p\u003e\u003cp\u003e$$$(0, 0) \\xrightarrow{\\text{Ashish }} (0, 1) \\xrightarrow{\\text{Utkarsh }} (0, 2)$$$.\u003c/p\u003e\u003cp\u003eAshish has no moves left, so Utkarsh wins.\u003c/p\u003e\u003cp\u003e\u003cimg class\u003d\"tex-graphics\" src\u003d\"CDN_BASE_URL/430cc189c42bb8f2c831acb9081eef3e?v\u003d1714297903\" style\u003d\"max-width: 100.0%;max-height: 100.0%;\"\u003e\u003c/p\u003e"}}]}