Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and as usual, Ashish moves first.

Consider the 2D plane. There is a token which is initially at (0,0). In one move a player must increase either the x coordinate or the y coordinate of the token by exactly k. In doing so, the player must ensure that the token stays within a (Euclidean) distance d from (0,0).

In other words, if after a move the coordinates of the token are (p,q), then p^2 + q^2 ≤ d^2 must hold.

The 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.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases.

The only line of each test case contains two space separated integers d (1 ≤ d ≤ 10^5) and k (1 ≤ k ≤ d).

Output

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

Example

Input


5
2 1
5 2
10 3
25 4
15441 33


Output


Utkarsh
Ashish
Utkarsh
Utkarsh
Ashish

Note

In the first test case, one possible sequence of moves can be

(0, 0) \xrightarrow{Ashish } (0, 1) \xrightarrow{Utkarsh } (0, 2).

Ashish has no moves left, so Utkarsh wins.

<image>
#include<bits/stdc++.h>
 
using namespace std;
 
template <class T> ostream& operator << (ostream &os, const vector<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T> ostream& operator << (ostream &os, const set<T> &v) { for (T i : v) os << i << ' '; return os; }
template <class T, class S> ostream& operator << (ostream &os, const pair<T, S> &v) { os << v.first << ' ' << v.second; return os; }
template <class T, class S> ostream& operator << (ostream &os, const map<T, S> &v) { for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' '; return os; }
template <class T, class S> ostream& operator << (ostream &os, const unordered_map<T, S> &v) { for (auto i : v) os << '(' << i.first << "=>" << i.second << ')' << ' '; return os; }
 
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <class Arg1> void __f(const char* name, Arg1&& arg1) { cerr << name << " : " << arg1 << endl; }
    template <class Arg1, class... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args) {
        const char* sep = strchr(names + 1, ',');
        cerr.write(names, sep - names) << " : " << arg1 << "  ";
        __f(sep + 1, args...);
    }
#else
#define trace(...) 0
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif
 
#define fast_cin() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX 1000000
#define ll long long
#define int ll
#define db double
#define str string
#define pb push_back
#define For(i,s,e) for (ll i=(s); i<(e); i++)
#define Forrev(i,s,e) for (ll i=(s); i>=(e); i--)
#define all(v) v.begin(),v.end()
 
#define vll vector<ll>
#define vs vector<string>
#define mapll map<ll,ll>
#define pll pair<ll,ll>
#define initialise(a, x) memset(a, x, sizeof(a))
#define maxheap priority_queue<ll>
#define minheap priority_queue<ll,vector<ll> ,greater<ll>>
 
#define ff first
#define ss second
#define endl "\n"
#define mp make_pair
const ll mod=1e9 + 7;
 
ll takemod(ll a) {
    return ((a%mod)+mod)%mod;
}
 
ll gcd(ll a, ll b) { 
    if (b == 0) 
        return a; 
    return gcd(b, a % b);        
}
 
ll fast_exp(ll base, ll expo) {
    ll res=1;
    while(expo>0) {
        if(expo&1) res=(res*base)%mod;
        base=(base*base)%mod;
        expo>>=1;}
    return res;
}
 
ll modinv(ll a) {
    return takemod(fast_exp(takemod(a), mod-2));
}

map<pair<pair<int, int>, int>, int> map1;

int getAns(int val)
{
    int low = 0, high = 1e5;
    int ans = -1;

    while (low <= high)
    {
        int mid = (low + high)/2;

        if (mid * mid <= val)
        {
            ans = mid;
            low = mid + 1;
        }
        else
            high = mid - 1;
    }

    return ans;
}

bool check(int x, int y, int d, int k)
{
    if (((x+k)*(x+k)) + y*y <= d*d)
        return false;
    if (x*x + ((y+k)*(y+k)) <= d*d)
        return false;
    return true;
}

int divide(int start, int end, int turn, vector<pair<int, int>>& pos)
{

    if (start == end)
    {
        int val = (pos[start].first + pos[end].first);
        if (turn == 0)
        {
            if (val%2)
                return 1;
            else
                return 0;
        }
        else
        {
            if (val%2)
                return 0;
            else
                return 1;
        }
    }

    int nextstart = start;
    while (pos[nextstart].first == pos[start].first)
        nextstart++;

    int nextend = end;
    while (pos[nextend].second == pos[end].second)
        nextend--;

    int val1 = pos[start].first + pos[start].second;
    int val2 = pos[end].first + pos[end].second;

    if (turn == 0)
    {
        if (val1%2 == 0)
            return divide(nextstart, end, 1, pos);
        else
            return divide(start, nextend, 1, pos);
    }

    else
    {
        if (val1%2 == 1)
            return divide(nextstart, end, 0, pos);
        else
            return divide(start, nextend, 0, pos);
    }
}
 
void solve() 
{
    int n, k;
    cin >> n >> k;
    map1.clear();

    int y1 = (n/k)*k;

    vector<pair<int, int>> pos;

    for (int i = y1; i >= 0; i-=k)
    {
        int diff = n*n - (i*i);
        int x1 = getAns(diff);

        x1 = (x1/k)*k;
        if (check(x1, i, n, k))
            pos.push_back({x1/k,i/k});
    }
    sort(pos.begin(), pos.end());

    int val = divide(0,pos.size()-1,0,pos);

    if (val)
        cout << "Ashish" << endl;
    else
        cout << "Utkarsh" << endl;

}
 
signed main() 
{
    fast_cin();
    #ifndef ONLINE_JUDGE
    freopen("C:/IO/in.txt", "r", stdin);
    freopen("C:/IO/out.txt", "w", stdout);
    #endif
    
    int t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
    
    
    return 0;    
}