Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Game On Leaves

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAyush and Ashish play a game on an unrooted tree consisting of $$$n$$$ nodes numbered $$$1$$$ to $$$n$$$. Players make the following move in turns:

- Select any leaf node in the tree and remove it together with any edge which has this node as one of its endpoints. A leaf node is a node with degree less than or equal to $$$1$$$.

A tree is a connected undirected graph without cycles.

There is a special node numbered $$$x$$$. The player who removes this node wins the game.

Ayush moves first. Determine the winner of the game if each player plays optimally.

Input

The first line of the input contains a single integer $$$t$$$ $$$(1 \leq t \leq 10)$$$ — the number of testcases. The description of the test cases follows.

The first line of each testcase contains two integers $$$n$$$ and $$$x$$$ $$$(1\leq n \leq 1000, 1 \leq x \leq n)$$$ — the number of nodes in the tree and the special node respectively.

Each of the next $$$n-1$$$ lines contain two integers $$$u$$$, $$$v$$$ $$$(1 \leq u, v \leq n, \text{ } u \ne v)$$$, meaning that there is an edge between nodes $$$u$$$ and $$$v$$$ in the tree.

Output

For every test case, if Ayush wins the game, print "Ayush", otherwise print "Ashish" (without quotes).

Examples

Input

1 3 1 2 1 3 1

Output

Ashish

Input

1 3 2 1 2 1 3

Output

Ayush

Note

For the $$$1$$$st test case, Ayush can only remove node $$$2$$$ or $$$3$$$, after which node $$$1$$$ becomes a leaf node and Ashish can remove it in his turn.

For the $$$2$$$nd test case, Ayush can remove node $$$2$$$ in the first move itself.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/11/2021 10:28:00 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|