#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

ll Q, D, X, T;
ll comb[3010][3010];
void combinationDP(int n) {
    for (int i = 1; i < n + 1; i++) {
        for (int j = 0; j < n + 1; j++) {
            if (j == 0 || i == j) comb[i][j] = 1;
            else comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
            if(comb[i][j]>1e15) comb[i][j]=1e15+1;
        }
    }
}

int main(){
    combinationDP(3000);
    cin>>Q;
    REP(i,0,Q){
        cin>>D>>X>>T;
        if(comb[(X+D-1)][X]>T){
            p("ZETUBOU");
        }else{
            p("AC");
        }
    }

    return 0;
}