#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

const int N = 1500;
long long INF = 1LL<<50;
long long dp[N+1][N+1];  // dp[i][j] = i を j 個に分ける

void init() {
  for (int i = 0; i <= N; i++) {
    for (int j = 0; j <= N; j++) {
      if (i == 0)
        dp[i][j] = 1;
      else if (j == 0)
        dp[i][j] = 0;
      else
        dp[i][j] = min(dp[i-1][j] + dp[i][j-1], INF);
    }
  }
}


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  init();
  int q;
  cin >> q;
  while (q--) {
    int d, x;
    long long t;
    cin >> d >> x >> t;
    if (dp[x][d] > t)
      cout << "ZETUBOU" << endl;
    else
      cout << "AC" << endl;
  }
  
  return 0;
}