#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

vector<int> sieve(int n){
    vector<bool> f(n+1);
    for(int i=3; i<=n; i+=2) f[i] = 1;
    for(int i=3; i<=sqrt(n); i+=2) if(f[i]) for(int j=i*3; j<=n; j+=i) f[j] = 0;
    vector<int> res;
    if(n >= 2)res.push_back(2);
    for(int i=3; i<=n; i+=2) if(f[i]) res.push_back(i);
    return res;
}

class FastFactorizer {
    int limit;
    vector<int> primes, factor;
    void dfs(int k, long long value) {
        factor[(int)value] = primes[k];
        for(int i = k; i < (int)primes.size(); ++i) {
            long long nextValue = value*primes[i];
            if(nextValue > limit)return;
            dfs(i, nextValue);
        }
    }

public:
    FastFactorizer(){}
    FastFactorizer(int limit) {
        this->limit = limit;
        primes = sieve(limit);
        factor = vector<int>(limit + 1);
        dfs(0, 1);
    }
    map<int, int> factorize(int value) {
        assert(1 <= value && value <= limit);
        map<int, int> res;
        while(value != 1) {
            int prime = factor[value];
            res[prime]++;
            value /= prime;
        }
        return res;
    }
};

const int N = 3010;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    FastFactorizer ff(N);
    vector<map<int, int>> f(N);
    for(int i = 2; i < N; ++i)f[i] = ff.factorize(i);

    int Q;
    cin >> Q;
    while(Q--) {
        ll d, x, t; cin >> d >> x >> t;
        d--;

        map<int, int> a;
        for(int i = 2; i <= x + d; ++i) {
            each(p, f[i])a[p.first] += p.second;
        }
        for(int i = 2; i <= x; ++i) {
            each(p, f[i])a[p.first] -= p.second;
        }
        for(int i = 2; i <= d; ++i) {
            each(p, f[i])a[p.first] -= p.second;
        }

        ll y = 1;
        each(p, a) {
            int b = p.first;
            for(int i = 0; i < p.second && y <= t; ++i) {
                if(y*b / b != y) {
                    y = LLONG_MAX;
                    break;
                }
                y *= b;
            }
            if(y > t)break;
        }
        cout << (y <= t ? "AC" : "ZETSUBOU") << endl;
    }
}