#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>

using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
#define vunique(v) unique(v.begin(), v.end())
#define mp make_pair
#define ts(x) to_string(x)
#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define repm(i, a, b) for(int i = (int)a; i > (int)b; i--)
#define bit(a) bitset<8>(a)
#define des_priority_queue priority_queue<int, vector<int>, greater<int> >
#define all(v) (v).begin(), (v).end()
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1e18;

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

	int Q;
	cin >> Q;
	vector<string> rsl;
	rep(i, 0, Q) {
		int D, X;
		ll T;
		cin >> D >> X >> T;
		ll cnt = 1;
		rep(i, 1, D) {
			cnt = cnt * (X + i) / i;
			if(cnt > T) break;
		}
		if(cnt > T) rsl.push_back("ZETUBOU");
		else rsl.push_back("AC");
	}
	rep(i, 0, rsl.size()) cout << rsl[i] << endl;
}