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.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        Scanner in = new Main().new Scanner(inputStream);
        Main solver = new Main();
        solver.runn(in);
    }

    public void runn(Scanner in) {
        int t = in.ni();
        while (t-- > 0) {
            int d = in.ni(), k = in.ni();
            List<Pair> killpts = new ArrayList<>();
            boolean even = false;
            for (int i = 0; i <= d; i += k) {
                int highest = (int) Math.floor(Math.sqrt(d * d - i * i));
                highest = highest / k * k;
                if (Math.abs(i / k - highest / k) <= 1) {
                    if ((i / k + highest / k) % 2 == 0)
                        even = true;
                    else
                        even = false;
                }
                killpts.add(new Pair(i / k, highest / k));
            }
            // for (Pair p : killpts) {
            // System.out.println(p.first() + ", " + p.second());
            // }
            System.out.println(even ? "Utkarsh" : "Ashish");
        }
    }

    class Scanner {
        BufferedReader br;
        StringTokenizer in;

        public Scanner(InputStream inputStream) {
            br = new BufferedReader(new InputStreamReader(inputStream));
        }

        public String next() {
            return hasMoreTokens() ? in.nextToken() : null;
        }

        public String rl() {
            try {
                return br.readLine();
            } catch (Exception e) {
                e.printStackTrace();
                return null;
            }
        }

        boolean hasMoreTokens() {
            while (in == null || !in.hasMoreTokens()) {
                String s = rl();
                if (s == null)
                    return false;
                in = new StringTokenizer(s);
            }
            return true;
        }

        public String nextString() {
            return next();
        }

        public int ni() {
            return Integer.parseInt(nextString());
        }

        public double nd() {
            return Double.parseDouble(nextString());
        }

        public long nl() {
            return Long.parseLong(nextString());
        }

        public int[] nia(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = ni();
            }
            return a;
        }

        public long[] nla(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                a[i] = ni();
            }
            return a;
        }
    }

    class Pair implements Comparable<Pair> {
        long _first, _second;

        public Pair(int f, int s) {
            _first = f;
            _second = s;
        }

        public Pair(Long f, Long s) {
            _first = f;
            _second = s;
        }

        public int compareTo(Pair o) {
            if (this.first() != o.first())
                return Long.compare(this.first(), o.first());
            else
                return Long.compare(this.second(), o.second());
        }

        long first() {
            return _first;
        }

        long second() {
            return _second;
        }

        int firsti() {
            return (int) _first;
        }

        int secondi() {
            return (int) _second;
        }
    }

    class Triple implements Comparable<Triple> {
        Integer _first, _second, _third;

        public Triple(Integer f, Integer s, Integer t) {
            _first = f;
            _second = s;
            _third = t;
        }

        public int compareTo(Triple o) {
            if (!this.first().equals(o.first()))
                return this.first() - o.first();
            else if (!this.second().equals(o.second()))
                return this.second() - o.second();
            else
                return this.third() - o.third();
        }

        Integer first() {
            return _first;
        }

        Integer second() {
            return _second;
        }

        Integer third() {
            return _third;
        }

        public String toString() {
            return first() + " " + second() + " " + third();
        }
    }
}
