#include <cstdio>
#include <iostream>
#include <algorithm>
#include <complex>
#include <queue>
#include <map>
#include <string>
using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)

#define PI 3.1415926535

typedef long long ll;
typedef pair<int, int> P;
//typedef complex<double> C;

const int MAX = 3100;
const ll INF = 1e16;

ll C[MAX + 1][MAX + 1];

void setPascal(int N) {
	REP(i, N + 1) {
		C[i][0] = C[i][i] = 1;
	}
	FOR(i, 1, N + 1) {
		FOR(j, 1, i) {
			C[i][j] = C[i-1][j-1] + C[i-1][j];
			if (C[i][j] > INF) {
				C[i][j] = INF;
			}
		}
	}
}

ll getH(int n, int k) {
	return C[n + k - 1][k];
}

void solve() {
	int Q;
	cin >> Q;
	setPascal(MAX);
	REP(i, Q) {
		int D, X;
		ll T;
		cin >> D >> X >> T;
		if (getH(X + 1, D - 1) <= T) {
			cout << "AC" << endl;
		} else {
			cout << "ZETUBOU" << endl;
		}
	}
}

int main() {
	//input();
	solve();
}