#include <iostream> #include <algorithm> #include <functional> #include <string> #include <climits> #include <vector> #include <numeric> #include <complex> #include <map> #include <bitset> using namespace std; #define __int64 long long #define long __int64 #define REP(i,a,b) for(int i=a;i<b;i++) #define rep(i,n) REP(i,0,n) const int Vecy[4] = {0,-1,0,1}; const int Vecx[4] = {1,0,-1,0}; long comb_data[1501][751] = {0}; long limit = 1000000000000001; long comb(long n, long r){ if(n == r || r == 0){ return 1; }else{ long kekka; if(comb_data[n-1][r-1] != 0){ kekka = comb_data[n-1][r-1]; }else{ kekka = comb(n-1, r-1); } if(comb_data[n-1][r] != 0){ kekka += comb_data[n-1][r]; }else{ kekka += comb(n-1, r); } comb_data[n][r] = min(limit, kekka); return kekka; } } int main(){ int q; int d,x; long t; cin >> q; rep(i,q){ cin >> d >> x >> t; d --; if(comb(d+x, min(d, x)) <= t){ cout << "AC" << endl; }else{ cout << "ZETUBOU" << endl; } } return 0; }