#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a,long long b){
	return b ? gcd(b,a%b) : a;
}
long long lcm(long long a,long long b){
	return a / gcd(a,b) * b;
}

long long mul(long long a,long long b,const long long mod){
	return b?(mul(a*2,b/2,mod)+(b&1?a:0))%mod:0;
}

long long bpow(long long a,long long b,const long long mod){
	return (b?bpow(a*a%mod,b/2,mod)*(b&1?a:1):1)%mod;
}

long long inv(long long a,const long long mod){
	return bpow(a,mod-2,mod);
}

// to overflow
/*long long bpow(long long a,long long b,const long long mod){
	return (b?mul(bpow(mul(a,a,mod),b/2,mod),(b&1?a:1),mod):1)%mod;
}*/
class mInt{
public:
	static const long long mod = 1000000007;
	long long v;
	mInt():v(0){}
	mInt(long long v):v((v%mod+mod)%mod){}
};
mInt& operator += (mInt &a,mInt b){ return a = a.v + b.v; }
mInt& operator -= (mInt &a,mInt b){ return a = a.v - b.v; }
mInt& operator *= (mInt &a,mInt b){ return a = a.v * b.v; }
mInt& operator /= (mInt &a,mInt b){ return a = a.v * inv(b.v,mInt::mod); }
mInt operator + (mInt a,mInt b){ return a += b; }
mInt operator - (mInt a,mInt b){ return a -= b; }
mInt operator * (mInt a,mInt b){ return a *= b; }
mInt operator / (mInt a,mInt b){ return a /= b; }
ostream& operator<<(ostream& os, const mInt& x){ return os << x.v; }

double ncr1[4000][4000];
long long ncr2[4000][4000];

long long nHr(int n,int r){
	int a = n + r - 1;
	int b = r-1;
	if( ncr1[a][b] > 1e17 ) return 1e17;
	return ncr2[a][b];
}

int main(){
	ncr1[0][0] = ncr2[0][0] = 1;
	for(int i = 0 ; i < 3200 ; i++)
		for(int j = 0 ; j < 3200 ; j++)
			ncr1[i+1][j] += ncr1[i][j],
			ncr1[i+1][j+1] += ncr1[i][j],
			ncr2[i+1][j] += ncr2[i][j],
			ncr2[i+1][j+1] += ncr2[i][j];
	int Q;
	cin >> Q;
	while(Q--){
		long long D,X,T;
		cin >> D >> X >> T;
		X++;
		D--;
		if( nHr(D,X) > T ){
			cout << "ZETUBOU" << endl;
		}else cout << "AC" << endl;
	}
}