#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define REP(i, n) for(int(i)=0;(i)<(n);++(i))
#define in(T,V) T V;cin>>V;
const int MOD = int(1e9+7);

const ll LIM = 1000000000000000;
ll dp[1555][1555]; // dp[d][x]

int main(){
    REP(i,1555) dp[1][i] = dp[i][0] = 1;
    for(int d = 2; d <= 1500; d++){
        for(int x = 1; x <= 1500; x++){
            dp[d][x] = dp[d-1][x] + dp[d][x-1];
            if(dp[d][x] > LIM) dp[d][x] = LIM+1;
        }
    }
    in(int,Q);
    REP(i,Q){
        in(ll,D);
        in(ll,X);
        in(ll,T);
        cerr << dp[D][X] << " : " << T << endl;
        bool res = dp[D][X] <= T;
        cout << (res ? "AC" : "ZETUBOU") << endl;
    }
}