#include typedef long long ll; using namespace std; ll INF = 1e17; int MOD = 1e9+7; ll dp[1510][1510]; main(){ fill(dp[0],dp[0]+1501,1); for(int i = 0;i <= 1500;i++)dp[i][0] = 1; for(int i = 1;i < 1500;i++){ for(int j = 1;j <= 1500;j++){ if(dp[i-1][j] > (ll)(1e15) || dp[i][j-1] > (ll)(1e15)) dp[i][j] = INF; else dp[i][j] = dp[i-1][j] + dp[i][j-1]; } } int Q; cin >> Q; for(int i = 0;i < Q;i++){ ll D,T,X; cin >> D >> T >> X; if(dp[D-1][T] > X)cout << "ZETUBOU" << endl; else cout << "AC" << endl; } }