#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
const ll LIM = 1000000000000000ll;

ll dp[1501][1501];
ll solve(int X, int D){
  if(D == 1)return 1;
  if(dp[X][D] != -1)return dp[X][D];
  
  ll res = solve(X, D - 1);
  if(X > 0){
    res += solve(X - 1, D);
  }
  if(res > LIM){
    res = LIM + 1;
  }
  return dp[X][D] = res;
}

int main(){
  memset(dp, -1, sizeof(dp));
  
  int Q;
  cin >> Q;
  
  for(int q=0;q<Q;q++){
    int X, D;
	ll T;
    cin >> D >> X >> T;
    if(solve(X, D) <= T){
      cout << "AC" << endl;
    } else {
      cout << "ZETUBOU" << endl;
    }
  }
  return 0;
}