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.util.Scanner;

import static java.lang.Math.min;
import static java.lang.Math.sqrt;

/**
 * Accomplished using the EduTools plugin by JetBrains https://plugins.jetbrains.com/plugin/10081-edutools
 */

public class Main {
   public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      int t = sc.nextInt();
      while (t-- > 0) {
         int d = sc.nextInt();
         int k = sc.nextInt();
         int x = 0, y = 0;
         boolean turn = true;
         while (true) {
            if (x*x + y*y > d*d) {
               break;
            }
            turn = !turn;
            double targetX = sqrt((x+1)*(x+1) + y * y);
            double targetY = sqrt(x*x + (y+1)*(y+1));
            double remainingX = d - targetX;
            double remainingY = d - targetY;
            int divX = (int) (remainingX/k);
            int divY = (int) (remainingY/k);
            double extraX = remainingX - (divX * k);
            double extraY = remainingY - (divY * k);
            double distX = extraX;
            double distY = extraY;
            if (divX%2!=0) {
               distX = 1.0-distX;
            }
            if (divY%2!=1) {
               distY = 1.0-distY;
            }
            if (targetX*targetX>d*d && targetY*targetY>d*d) {
               break;
            }
            if (targetX*targetX>d*d) {
               y += k;
               continue;
            }
            if (targetY*targetY>d*d) {
               x += k;
               continue;
            }
            if (distX<=distY) {
               x += k;
            }
            else {
               y += k;
            }
         }
         if (turn) {
            System.out.println("Ashish");
         }
         else {
            System.out.println("Utkarsh");
         }
      }
   }
}