#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

map<pair<int,int>,long long> comb;

long long combination(int n, int k) {
    pair<int,int> p {n,k};
    if (n == k || k == 0)
        return 1;
    else if (comb.count(p) > 0)
        return comb[p];
    else {
        long long ret = min(1000000000000001LL,combination(n-1,k) + combination(n-1,k-1));
        comb[p] = ret;
        return ret;
    }
}

int main() {
    int i, j, q;
    cin >> q;
    rep (i,q) {
        int d,x;
        long long t;
        cin >> d >> x >> t;
        if (combination(x+d-1,d-1) <= t)
            cout << "AC" << endl;
        else
            cout << "ZETUBOU" << endl;
    }
    return 0;
}