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>
import java.io.*;
import java.util.*;
public class Main {

	public static final int mod=1000000007;	
	static long[][] dp;
	public static void main(String[] args) throws IOException {
		
		//File filein = new File("input.txt");
		//BufferedReader sc=new BufferedReader(new FileReader(filein));
		//PrintWriter out=new PrintWriter(new FileWriter("output.txt"));		

		//Scanner sc=new Scanner(System.in);
		BufferedReader sc=new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out=new PrintWriter(System.out);		
		int tt=Integer.parseInt(sc.readLine());
		int t=tt;
		while(t-->0){
			out.flush();
			String[] ip=sc.readLine().split(" ");
			int d=Integer.parseInt(ip[0]);
			int k=Integer.parseInt(ip[1]);
			int turn=0;
			long x=0,y=0;
			while(true){
				x+=(turn*k);
				y+=(1-turn)*k;
				if(!check(x,y,d)){
					out.println(turn==1?"Ashish":"Utkarsh");
					break;
				}
				turn=1-turn;
			}		
		}
		out.flush();
		out.close();
		sc.close();
	}

	static boolean check(long x,long y,long d){
		return (x*x + y*y) <= d*d;
	}

	static List<Integer> sieve(int n) 
    { 
        // Create a boolean array "prime[0..n]" and initialize 
        // all entries it as true. A value in prime[i] will 
        // finally be false if i is Not a prime, else true. 
        boolean prime[] = new boolean[n+1]; 
        for(int i=0;i<n;i++) 
            prime[i] = true; 
          
        for(int p = 2; p*p <=n; p++) 
        { 
            // If prime[p] is not changed, then it is a prime 
            if(prime[p] == true) 
            { 
                // Update all multiples of p 
                for(int i = p*p; i <= n; i += p) 
                    prime[i] = false; 
            } 
        }    
		List<Integer> primes=new LinkedList<>();
		for(int i=2;i<=n;i++){
			if(prime[i]) primes.add(i);
		}
		return primes;
	}

}