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 math
import bisect



MAX_D = 500000+7
# MAX_D = 20
seq = [float(math.ceil((n*n)/2.0)) for n in range(MAX_D)]


t = int(input())

for g in range(1, t+1):

    dk = input().split(" ")
    d = float(dk[0])
    k = float(dk[1])

    if d == k:
        print("Ashish")
        continue

    ratio = (d*d)/(k*k)


    # marker = bisect.bisect_left(seq, ratio, lo=1, hi=len(seq)) - 1

    left = 1
    right = len(seq) - 1
    marker = None
    prec = 20
    while left <= right:
        middle = math.floor((left + right)/2)
        # print(f"l: {left} m: {middle} r: {right} seq[middle]: {seq[middle]:.30f} ratio: {ratio:.30f}")
        if seq[middle] == ratio:
            marker = middle
            break
        elif(seq[middle] < ratio):
            marker = middle            
            left = middle + 1
        elif (seq[middle] > ratio):
            right = middle - 1



    # n_marker = -1
    # prec = 20
    # for i in range(1, len(seq)):
    #     if(round(seq[i], prec) <= round(ratio, prec)):
    #         n_marker = i
    #     else:
    #         break
    

    # if n_marker != marker:
    #     print("-----------------------------")
    #     print(f"index: {marker}")
    #     print(f"new index: {n_marker}")
    #     print(f"d: {d} k: {k}")

    if(marker % 2 == 0):
        print("Utkarsh")
    else:
        print("Ashish")
