#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("AC");}else{puts("ZETUBOU");} #define MAX_N 200005 ll com[3010][3010]; int main() { srep(i,1,3001){ ll tmp = 1; rep(j,3000){ com[i][j] = tmp; com[i][i-j] = tmp; if(j + 1 >= i - j)break; if(tmp > 1000000000000000){ srep(k,j,i-j)com[i][k] = tmp; break; } tmp *= i - j; tmp /= j + 1; } } int q; cin >> q; rep(loop, q){ ll d, x, t; cin >> d >> x >> t; if(com[x+d-1][x] <= t)yn; } return 0; }