#include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <utility>

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define DEBUG(x) cout<<#x<<": "<<x<<endl

using namespace std;

typedef pair<int,int> P;
typedef long long int LL;

LL dp[1500+1][1500];//x,d

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

	REP(i,1500+1){
		REP(j,1500){
			if(j==0){
				dp[i][j]=1;
			}else if(i==0){
				dp[i][j]=1;
			}else{
				dp[i][j]=dp[i-1][j]+dp[i][j-1];
				if(dp[i][j]>1000000000000000)	dp[i][j]=1000000000000000+1;
			}
		}
	}

	int q;
	cin>>q;
	vector<int> d(q);
	vector<int> x(q);
	vector<LL> t(q);
	REP(i,q)	cin>>d[i]>>x[i]>>t[i];
	REP(i,q){
		d[i]--;
		DEBUG(d[i]);
		DEBUG(x[i]);
		DEBUG(dp[x[i]][d[i]]);
		if(dp[x[i]][d[i]]<=t[i]){
			cout<<"AC"<<endl;
		}else{
			cout<<"ZETUBOU"<<endl;
		}
	}
	return 0;
}