#include <iostream>
using namespace std;

typedef long long ll;

const int deplim = 1500;
const int xlim = 1500;
const int inf = -1;

ll dp[deplim+1][xlim+1];

void init();
int main(){
  init();

  int q; cin >> q;
  for(int i=0; i<q; i++){
    ll d, x, t;
    cin >> d >> x >> t;

    if(dp[d][x] > t || dp[d][x] < 0){
      cout << "ZETUBOU" << endl;
    }
    else{
      cout << "AC" << endl;
    }
  }

  return 0;
}

void init(){
  for(int i=0; i<=xlim; i++) dp[i][0] = 1;

  for(int d=0; d<deplim; d++){
    for(int x=1; x<=xlim; x++){
      if(dp[d+1][x-1]<0 || dp[d][x]<0){
        dp[d+1][x] = inf;
      }
      else{
        dp[d+1][x] = dp[d+1][x-1] + dp[d][x];
      }
    }
  }
}