#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


int main(){
  int Q;
  ll D, X, T;

  cin >> Q;
  rep(i,Q){
    cin >> D >> X >> T;
    if(D==1){
      if(1<=T) cout << "AC" << endl;
      else cout << "ZETUBOU" << endl;
    }
    else if(D==2){
      if(X+1<=T) cout << "AC" << endl;
      else cout << "ZETUBOU" << endl;
    }
    else{
      double a = 0, b = log(T);
      ll aa = X+1;
      rep(j,D-1){
        a += log(aa);
        aa++;
      }
      ll bb = 2;
      rep(j,D-2){
        b += log(bb);
        bb++;
      }
      if(a>b) cout << "ZETUBOU" << endl;
      else cout << "ZETUBOU" << endl;
    }
  }
  
  return 0;
}