#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const long long INF = LLONG_MAX / 4;

void combination(int n, vector<vector<long long> >& comb)
{
    comb.assign(n+1, vector<long long>(n+1, 0));
    for(int i=0; i<=n; ++i){
        comb[i][0] = 1;
        for(int j=1; j<=i; ++j){
            comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
            comb[i][j] = min(INF, comb[i][j]);
        }
    }
}

int main()
{
    vector<vector<long long> > comb;
    combination(3000, comb);

    int q;
    cin >> q;

    while(--q >= 0){
        int d, x;
        long long t;
        cin >> d >> x >> t;

        if(comb[x+d-1][x] <= t)
            cout << "AC" << endl;
        else
            cout << "ZETUBOU" << endl;
    }

    return 0;
}