It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits.

Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits.
The single line contains integer *y* (1000 ≤ *y* ≤ 9000) — the year number.
#include <bits/stdc++.h>
using namespace std;
#define read(type) readInt<type>() // Fast read
#define ll long long
#define nL "\n"
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define umap unordered_map
#define uset unordered_set
#define MOD 1000000007
void solve()
{
 
    int n, x;
    cin >> n >> x;
    int u, v;
    int cnt = 0;
    for (int i = 0; i < n - 1; i++)
    {
        cin >> u >> v;
        if (u == x || v == x)
        {
            cnt++;
        }
    }
    if (cnt <= 1)
    {
        cout << "Ayush" << endl;
        return;
    }
    n = n -2;
    if(n%2==0)
    {
        cout<<"Ayush"<<endl;
    }
    else
    {
        cout<<"Ashish"<<endl;
    }
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int ttt;
    cin >> ttt;
    for (int i = 1; i <= ttt; i++)
    {
        solve();
    }
    return 0;
}