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>
// package Rouhd_685;

import java.io.*;
import java.math.*;
import java.util.*;

public class Problem_D {  
    public static void main(String[] args) {
        FastReader in = new FastReader();
        PrintWriter out = new PrintWriter(System.out);
        
        int numTrials = in.nextInt();
        while(numTrials --> 0) {
            int d = in.nextInt(), k = in.nextInt();
            long dSq = (long)d * d;
            
            int winner = 0;
            
            if(k >= d) {
            	winner = 1;
            }
            else if(d / (double)k <= 2) {
            	winner = 2;
            }
            else {
            	int sVal = (int) Math.max(0, Math.sqrt(dSq / 2) - 2);
            	
            	int x = sVal, y = sVal;
            	int moves = sVal * 2;
            	
            	while(Math.pow(x, 2) + Math.pow(y, 2) < dSq) {
            		moves++;
            		if(x > y) {
            			y++;
            		}
            		else {
            			x++;
            		}
            	}
            	
            	
            	
            	if(moves % 2 == 0) {
            		winner = 2;
            	}
            	else {
            		int nSVal = (int) Math.max(0, -4 + Math.sqrt(8 * dSq - 16) / 4);
            		sVal = nSVal;
            		x = sVal + 2;
            		y = sVal;
            		moves = sVal * 2 + 2;
            		
            		while(Math.pow(x, 2) + Math.pow(y, 2) < dSq) {
            			moves++;
            			if(x - y == 2) {
            				y++;
            			}
            			else {
            				x++;
            			}
            		}
            		
            		int fMoves = moves;
            		
            		sVal = nSVal;
            		x = sVal + 2;
            		y = sVal;
            		moves = sVal * 2 + 2;
            		
            		while(Math.pow(x, 2) + Math.pow(y, 2) < dSq) {
            			moves++;
            			if(x - y == 2) {
            				x++;
            			}
            			else {
            				y++;
            			}
            		}
            		
            		int sMoves = moves;
            		
            		
            		if(fMoves % 2 == 1 || sMoves % 2 == 1) {
            			winner = 1;
            		}
            		else {
            			winner = 2;
            		}
            	}
            }
            
            if(winner == 1) {
            	out.println("Ashish");
            }
            else {
            	out.println("Utkarsh");
            }
        }
        
        out.flush();
    }
    
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st;
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        }
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
}
