#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1'000'000'007;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

using Num = long long;
vector<vector<Num>> C;

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int Q; cin >> Q;
	int n = 3000;
	vector<Num> a(1, 1), b(2, 1);
	C = { a,b };
	for (int i = 3; i <= n + 1; i++) {
		swap(a, b);
		b.resize(i);
		b[0] = 1; b[i - 1] = 1;
		for (int j = 1; j < i - 1; j++) {
			if (a[j - 1] == LLONG_MAX || a[j] == LLONG_MAX)
				b[j] = LLONG_MAX;
			else if (a[j - 1] + a[j] > LLONG_MAX / 4)
				b[j] = LLONG_MAX;
			else
				b[j] = a[j - 1] + a[j];
		}
		C.emplace_back(b);
	}
	rep(_, 0, Q) {
		long long D, X, T; cin >> D >> X >> T;
		dump(C[X + D - 1][D - 1], T);
		if (C[X + D - 1][D - 1] > T)
			cout << "ZETUBOU" << endl;
		else
			cout << "AC" << endl;
	}
	return 0;
}