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 com.company;



import java.io.*;
import java.util.*;
import java.lang.Math;

public class Main <E> {

    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
    }


    Map<Integer, Boolean> cache;

    long MODULE = 1000_000_000+7;
    public void solve() {

        Scanner in = null;
        PrintWriter out = null;
        try {
            in = new Scanner(new File("input.txt"));
            out = new PrintWriter(new File("output.txt"));
//                throw new FileNotFoundException();
        }
        catch (FileNotFoundException e) {
            in = new Scanner(System.in);
            out = new PrintWriter(System.out);
        }

        int t = in.nextInt();




        for (int ti = 0; ti < t; ti++) {
            int d = in.nextInt();
            int k = in.nextInt();
            cache = new HashMap<>();
//
//            double sqrt = ((double) d) / Math.sqrt(2) ;
//            long wholePart = (long) sqrt;
//            double fractionalPart = sqrt - wholePart;
//
//            if ((wholePart - 1) * (wholePart - 1) + (wholePart + 2) * (wholePart + 2) > d * d) {
//                out.println("Utkarsh");
//            } else {
//                out.println("Ashish");
//            }

            boolean winner = wins(true, 0, 0, d, k);


            out.println(winner ? "Ashish" : "Utkarsh");
        }


        out.flush();

        out.close();
    }


    private boolean wins(boolean first, int x, int y, long d, int k) {
        if (((long)x) * x + y * y > 100000) {
            return true;
        }
        Integer hashKey = x > y
                ? y * 46340 + x
                : x * 46340 + y;
        if (cache.containsKey(hashKey)) {
            return cache.get(hashKey);
        }

        if (((long)x)*x + ((long)y)*y > d*d) {
            cache.put(hashKey, true);
            return true;
        }
        if (!wins(!first, x + k, y, d, k)) {
            cache.put(hashKey, true);
            return true;
        }
        if (!wins(!first, x, y + k, d, k)) {
            cache.put(hashKey, true);
            return true;
        }
        cache.put(hashKey, false);
        return false;
    }

}

