#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;


int D[10001];
int X[10001];
ll T[10001];

int main()
{
	
	int Q;  cin>> Q;
	
	for (int i = 0; i < Q; i++) {
		cin >> D[i] >> X[i] >> T[i];
	}

	for (int i = 0; i < Q; i++) {
		ll n = D[i] - 1;
		if (n == 0) {
			if (n <= T[i])
				cout << "AC" << endl;
			else
				cout << "ZETUBOU" << endl;
		}
		else if (n == 1) {
			if (X[i] + 1 <= T[i])
				cout << "AC" << endl;
			else
				cout << "ZETUBOU" << endl;
		}
		else {
			ll cnt = 0;
			for (int j = 0; j <= X[i]; j++) {
				cnt += (X[i] - j) * ((X[i] - j) + 1) / 2;
			}
			if (cnt > T[i])
				cout << "ZETUBOU" << endl;
			else
				cout << "AC" << endl;
		}
	}
	return 0;
}