#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <fstream>
#include <bitset>
#include <cassert>
#include <functional>
#include <cstring>
#include <ctime>
#include <cmath>
#include <set>
#include <map>
#define sec second
#define fir first
#include <algorithm>
#define pb push_back
#define mp make_pair
#define REP(i , n) for (int i = 0 ; i < (n) ; i++)
#define BACK(i , n) for (int i = (n) - 1 ; i >= 0 ; i--)
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int , int>;
using ll = long long;
using ld = long double;
const int MAX = 1e9 , MIN = - MAX , MOD = 1e9 + 7;
const ll MAX_LL = 1e18 , MIN_LL = -MAX_LL;
int main(){
    int T;
    cin >> T;
    while(T--){
        int d , k , maks = 0;
        cin >> d >> k;
        for (int i = 0 ; i <= d ; i += k){
            maks = max(maks , i / k + (int)sqrtl((ll)d * d - (ll)i * i) / k);
        }
        cout << (maks & 1 ? "Ashish" : "Utkarsh") << '\n';
    }
}
