#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

const LL CN = 3000;
LL C[CN+1][CN+1];
bool ans[10000];
LL cmax = (LL)1e15;
int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	for(int i=0; i <= CN; ++i){
		for(int j=0; j <= i; ++j){
			if( j == 0 || j == i){
				C[i][j] = 1;
			}
			else{
				if( C[i-1][j-1] > cmax || C[i-1][j] > cmax){
					C[i][j] = cmax + 1;
				}else{

					C[i][j] = (C[i-1][j-1]+C[i-1][j]);
					if(C[i][j] > cmax){
						C[i][j] = cmax + 1;
					}
				}
			}
		}
	}

	int Q;
	cin>>Q;
	LL D,X,T;
	rep(i,Q){
		cin>>D>>X>>T;
		if( C[D+X-1][X] <= T){
			ans[i] = true;
		}
	}
	rep(i,Q){
		if(ans[i]){
			P("AC");
		}else{
			P("ZETUBOU");
		}
	}

	return 0;
}