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>
/*input
5
2 1
5 2
10 3
25 4
15441 33

*/
import java.util.*;
public class Easy2{

static int calls =0;
	// private static int solve(int row, int col, int k, int d, HashMap<Integer, HashMap<Integer,Integer>> dp){
	// 	// calls++;
	// 	// if(calls>1000000){
	// 	// 	System.out.println("calls: "+calls );
	// 	// 	return -1;
	// 	// }
	// 	if(dp.containsKey(row)&&(dp.get(row).containsKey(col)))
	// 		return dp.get(row).get(col);
	// 	long left = (row*row);
	// 	left += (col*col);
	// 	long right = d*d;
	// 	int ans = 0;
	// 	if(left>right){
	// 		ans = -1;
	// 	} else{
	// 		if(solve(row,col+k,k,d,dp) == -1 || solve(row+k,col,k,d,dp)==-1)
	// 			ans = 1;
	// 		else
	// 			ans = -1;
	// 	}
	// 	if(!dp.containsKey(row))
	// 		dp.put(row, new HashMap<>());
	// 	dp.get(row).put(row, ans);
	// 	return ans;
	// }

	private static boolean inside(int x, int y, int d){
		return ((x*x + y*y) <= d*d);
	}

	private static boolean solve(int d, int k){
		int z = (int)(d/Math.sqrt(2));
		z/=k;
		int x = z*k;
		return inside(x,x+k,d);
	}

	public static void main(String[] args){
		// dp = new int[]
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt(),d,k;
		HashMap<Integer, HashMap<Integer,Integer>> dp;
		while(t>0)
		{
			t--;
			calls=0;
			d = sc.nextInt();			
			k = sc.nextInt();
			// // dp = new HashMap<>();
			// System.out.println(t+" "+d+" " +k+" "+((solve(0,0,k,d,dp)==1)?" Utkarsh ":"Ashish"));
			System.out.println(solve(d,k)?"Ashish":"Utkarsh");
		}
		sc.close();
	}
}