#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())

#define INF (1LL<<50)

long long dp[1501][1501];

int main(){
	dp[0][0]=1;
	rep(i,1500){
		long long s=0;
		rep(j,1501){
			s=min(s+dp[i][j],INF);
			dp[i+1][j]=s;
		}
	}
	int q;
	cin>>q;
	rep(i,q){
		int d,x;
		long long t;
		cin>>d>>x>>t;
		if(dp[d][x]<=t)cout<<"AC"<<endl;
		else cout<<"ZETUBOU"<<endl;
	}
	return 0;
}