#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
ll comb[3010][3010];
void init(){
  rep(i,3010){
    comb[i][0]=1;
    repl(j,1,i+1){
      comb[i][j]=comb[i-1][j]+comb[i-1][j-1];
      if(comb[i][j]>=1e16)comb[i][j]=INF;
    }
  }
}
bool solve(){
  ll d,x,t;cin >> d >> x >> t;
  d--;
  //cout << comb[x+d][d] <<endl;
  return comb[x+d][d]<=t;

}
int main(){
  init();
  rep(i,10){
    //rep(j,i+1)cout << comb[i][j] <<" ";cout << endl;
  }
  ll q;cin >> q;
  while(q--)cout << (solve()? "AC":"ZETUBOU") <<endl;
}