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 Codeforces
{
    public static void main(String args[])throws Exception
    {
        BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb=new StringBuilder();
        int t=Integer.parseInt(bu.readLine());
        while(t-->0)
        {
            String s[]=bu.readLine().split(" ");
            int d=Integer.parseInt(s[0]),k=Integer.parseInt(s[1]);
            int moves=d/k,i;
            long cur=1l*moves*k*moves*k,max=1l*d*d;
            int moves2=0;
            for(i=k;i<=d;i+=k)
            {
                long cr=1l*i*i+cur;
                if(cr<=max) moves2++;
                else break;
            }
            int x=0,sum=moves+moves2;
            if(prime(moves)) x++;
            if(prime(moves2)) x++;
            if(x==2 && sum%2==0) {sb.append("Ashish\n"); continue;}
            if(sum%2==1 && x>0) {sb.append("Ashish\n"); continue;}
            sb.append("Utkarsh\n");
        }
        System.out.println(sb);
    }

    static boolean prime(int n)
    {
        if(n<=1) return false;
        for(int i=2;i*i<=n;i++)
        if(n%i==0) return false;
        return true;
    }
}

