#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll nCr(int n, int r)
{
  if (n == r || r == 0)
    return 1;
  else
    return nCr(n, r - 1) * (n - r + 1) / r;
}

ll nCr2(int n, int r)
{
    if (n == r || r == 0)
        return 1;
    else{
        ll ans = 1;
        FOR(i, 1, r+1){
            ans *= n-r+i;
            ans /= i;
            if(ans > 1e15){
                return inf;
            }
        }
        return ans;
    }
}

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

    // input
    ll Q;
    cin >> Q;

    FOR(i, 0, Q){
        ll d, x, t;
        cin >> d >> x >> t;

        ll a = nCr2(x+d-1, d-1);
        if(a>t){
            p("ZETUBOU");
        }else{
            p("AC");
        }
    }
    
    return 0;
}