#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
typedef long long ll;

int main()
{
  int q;
  cin >> q;
  while(q--) {
    ll D, X, T;
    cin >> D >> X >> T;
    ll cnt = 1;
    FOR(i, 0, D-1) {
      cnt *= X + 1 + i;
      cnt /= i + 1;
      if(cnt > T) break;
    }
    if(cnt <= T) {
      puts("AC");
    } else {
      puts("ZETUBOU");
    }
  }
  return 0;
}