#include <cstdio>
#include <array>
#include <limits>

typedef long long ll;

int Q;
int D, X;
ll T;
// [段階][残り]
ll dp[1501][1501], sum[1501][1501];
ll MAX = 1000000000000000ll;

int main(){
    for(int i=0;i<=1500;i++){
        dp[0][i] = 1;
        
        dp[1][i] = i + 1;
        sum[1][i] = dp[1][i];
        if(i > 0){sum[1][i] += sum[1][i-1];}
    }

    for(int i=2;i<=1500;i++){
        for(int j=0;j<=1500;j++){
            if(dp[i][j] > MAX - sum[i-1][j]){
                dp[i][j] = MAX + 1;
            }else{
                dp[i][j] += sum[i-1][j];
            }

            sum[i][j] = dp[i][j];
            if(j == 0){continue;}
            if(sum[i][j] > MAX - sum[i][j-1]){
                sum[i][j] = MAX + 1;
            }else{
                sum[i][j] += sum[i][j-1];
            }
        }
    }

    scanf("%d", &Q);

    for(int i=0;i<Q;i++){
        scanf("%d %d %lld", &D, &X, &T);

        // printf("%lld\n", dp[D-1][X]);
        if(dp[D-1][X] > T){
            puts("ZETUBOU");
        }else{
            puts("AC");
        }
    }
}