/*
  tester atetubou's code
*/
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <sstream>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>

#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define iter(a) __typeof(a.begin())
#define FOR(it,a) for(iter(a)it=a.begin();it!=a.end();++it)
#define F first
#define S second
#define SZ(a) (int)((a).size())
#define sz(a) SZ(a)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ALL(a) (a).begin(),(a).end()
using namespace std;

typedef long long ll;
typedef pair<int,int> PI;
typedef unsigned long long ull;

#define PR(...) do{cerr << "line : " << __LINE__ << endl;pr(#__VA_ARGS__, __VA_ARGS__);}while(0);
template<class T>
void pr(const string& name, T t){
  cerr << name << ": " << t << endl;
}

template<typename T, typename ... Types>
void pr(const string& names, T t, Types ... rest) {
  auto comma_pos = names.find(',');
  cerr << names.substr(0, comma_pos) << ": " << t << ", ";

  auto next_name_pos = names.find_first_not_of(" \t\n", comma_pos + 1);
  pr(string(names, next_name_pos), rest ...);
}

template<class T,class U> ostream& operator<< (ostream& o, const
pair<T,U>& v){return o << "(" << v.F << ", " << v.S << ")";}
template<class T> ostream& operator<< (ostream& o, const vector<T>&
v){o << "{";rep(i,SZ(v)) o << (i?", ":"") << v[i];return o << "}";}

const int dx[] = {0,1,0,-1};
const int dy[] = {-1,0,1,0};
#define endl '\n'

ll memo[1600][1600];
ll sum[1600][1600];
ll rec(int,int);
ll INF=1LL<<60LL;
ll sumr(int d,int x){
  if(x<0) return 0;
  if(sum[d][x]>=0) return sum[d][x];
  ll& ret = sum[d][x] = 0;
  ret += rec(d,x) + sumr(d,x-1);
  ret = min(ret,INF);
  return ret;
}

ll rec(int d,int x){
  if(d==0) return 1;
  if(memo[d][x] >= 0) return memo[d][x];
  ll& ret = memo[d][x] = 0;
  //ret = rec(d-1,x) + rec(d-1,x-1);
  ret = sumr(d-1,x);
  ret = min(ret,INF);
  return ret;
}

int main(int argc, char *argv[])
{
  memset(memo,-1,sizeof(memo));
  memset(sum,-1,sizeof(sum));
  int t;
  cin >> t;
  rep(i,t){
    int d,x;
    ll t;
    cin >> d >> x >> t;
    //PR(rec(d-1,x));
    cout << (rec(d-1,x) <= t ? "AC" : "ZETUBOU") << endl;
  }
  return 0;
}