#include <iostream>
#include <sstream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define SUM(a) accumulate(ALL(a), 0)
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int Q, D, X, T;
int comb[3100][3100];

signed main()
{
    int border = pow(10, 15) + 1;
    REP(i,3100) {
        comb[i][0] = 1;
        comb[i][i] = 1;
        FOR(j,1,i) {
            comb[i][j] = min(comb[i-1][j-1] + comb[i-1][j], border);
        }
    }
    vector<bool> ans;
    cin >> Q;
    while(Q--) {
        cin >> D >> X >> T;
        D--;
        bool ret = (comb[X+D][D] <= T);
        ans.push_back(ret);
    }
    
    REP(i,ans.size()) {
        cout << (ans[i] ? "AC" : "ZETUBOU") << endl;
    }
    
    return 0;
}