#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

int main(){
	int q;
	cin >> q;

	vector<vector<long long>> dp(4000, vector<long long>(4000,0));
	dp[0][0] = 1;
	for(int i=1; i<4000; i++){
		for(int j=0; j<=i; j++){
			if((dp[i-1][j] < 0) || (j>0 && dp[i-1][j] < 0) ){
				dp[i][j] = -1;
				continue;
			}

			dp[i][j] = dp[i-1][j] + (j>0?dp[i-1][j-1]:0);
			if(dp[i][j] >= 1e18) dp[i][j] = -1;
		}
	}

	while(q--){
		long long d,x;
		long long t;
		cin >> d >> x >> t;

		//cerr << dp[d+x-1][x] << endl;
		if(dp[d+x-1][x] >= 0 && dp[d+x-1][x] <= t){
			cout << "AC" << endl;
		}else{
			cout << "ZETUBOU" << endl;
		}

	}
	return 0;
}