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;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LB lower_bound
#define UB upper_bound
#define EQ equal_range
#define prako ios::sync_with_stdio(0); cin.tie(0);
#define deb(x) cout<<x<<"\n";
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
typedef long long int ll;
typedef pair<int,int> pi;
#define rep(i,a,b) for(ll i=a; i<=b; i++)

void solve(){
    ll t;cin>>t;
    while(t--){
        ll d,k;cin>>d>>k;
        ll x=0,y=0,count=0,flag=0;
        while(1){
        	if(((x+k)*(x+k))+(y*y) <= (d*d) && flag==0){
        		x+=k;
        		flag=1;
        		count++;
        	}
        	else if(((y+k)*(y+k))+(x*x) <= (d*d) && flag==1){
        		y+=k;
        		flag=0;
        		count++;
        	}
        	else break;
        }
        if(count%2==0) cout<<"Utkarsh\n";
        else cout<<"Ashish\n";
    }
}
int main() {
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    prako
    solve();
	return 0;
}
