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

typedef long long ll;

ll Q,D,X,T;

ll comb[4000][2000];

ll combination(ll n,ll r){
    if(r<=0||n<r) return 0;
    else if(comb[n][r]!=0) return comb[n][r];
    else if(r==1) return comb[n][r]=n;
    else{
        comb[n][r]=0;
        comb[n][r]+=combination(n-1,r);
        if(comb[n][r]>T){
            comb[n][r]=T+10;
            return comb[n][r];
        }else{
            comb[n][r]+=combination(n-1,r-1);
        }
        if(comb[n][r]>T){
            comb[n][r]=T+10;
        }
        return comb[n][r];
    }
}

void solve(){
    cin>>D>>X>>T;
    if(combination(D+X-1,X)>T){
        cout<<"ZETUBOU"<<endl;
    }else{
        cout<<"AC"<<endl;
    }
    return;
}

int main(){
    cin>>Q;
    for(int i=0;i<Q;i++){
        solve();
    }
    return 0;
}