#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;

long long a[3003][3003];

void comb(int n) {
	REP(i, 3003) {
		a[i][0] = 1;
		a[i][i] = 1;
	}
	FOR(i, 1, n + 1) {
		FOR(j, 1, (i + 3) / 2) {
			a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
			a[i][i - j] = a[i][j];
			if (a[i][j] > (1LL << 50))
				a[i][j] = (1LL << 50);
		}
	}
}

int main() {
	int q;
	cin >> q;
	string ac = "AC";
	string ze = "ZETUBOU";
	vector<string> ans;
	comb(3000);
	REP(i, q) {
		LL d, x, t;
		cin >> d >> x >> t;
		LL sum = a[x + d - 1][x];
		if (t >= sum)
			ans.push_back(ac);
		else
			ans.push_back(ze);
	}
	for (string e : ans) {
		cout << e << endl;
	}
	return 0;
}