#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i,a,b) for(int i=a;i<(int)b;i++) #define rep(i,n) REP(i,0,n) #define all(c) (c).begin(), (c).end() #define zero(a) memset(a, 0, sizeof a) #define minus(a) memset(a, -1, sizeof a) #define minimize(a, x) a = std::min(a, x) #define maximize(a, x) a = std::max(a, x) using ll = long long; int const inf = 1<<29; int const MOD = 1e9+7; ll comb[1111][1111]; void make_comb(int n) { rep(i, n+1) { comb[i][0] = 1; REP(j, 1, i+1) { comb[i][j] = comb[i-1][j-1] + comb[i-1][j]; // comb[i][j] %= MOD; } } } int main() { make_comb(1000); int Q; cin >> Q; rep(_, Q) { int D, X; ll T; cin >> D >> X >> T;// D--; X++; cout << comb[X+D][D-1] << endl; cout << (T >= comb[X+D][D-1] ? "AC" : "ZETUBOU") << endl; } return 0; }