#include <math.h>
#include <stdio.h>

#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

#define int ll
#define PI acos(-1.0)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;

ll t;
ll d, k;

int shem(ll d) {
// d =
    ll tmp;
    ll n = d / 2;
    ll sq = (int)(sqrt(n) - 1);
    if (sq < 0) sq = 0;
    for (n = d / 2; ; n++) {
        while(sq * sq <= n) sq++;
        sq--;
        tmp = n + sq * sq;
        if (tmp == d) return 2;
        if (tmp > d) return 1;
    }
    return false;
}

signed main() {
    cout.precision(15);
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>t;
    while (t--) {
        cin>>d>>k;
        d = d * d / k / k;
        int pas = shem(d);
        cout << (pas == 2 ? "Utkarsh" : "Ashish") << endl;
    }
    return 0;
}
