#include using namespace std; #define rep(i,n) for(ll i=0;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,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; 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 inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template 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] <> q; while(q--)cout << (solve()? "AC":"ZETUBOU") <