#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll pas[1600][1600]; void solve() { rep(i, 1505)rep(j, 1505) { if (i == 0 || j == 0)pas[i][j] = 1; else { pas[i][j] = pas[i - 1][j] + pas[i][j - 1]; pas[i][j] = min(pas[i][j],INF); } } int q; cin >> q; rep(i, q) { int d, x; ll t; cin >> d >> x >> t; if (pas[d-1][x] > t) { cout << "ZETUBOU\n"; } else { cout << "AC\n"; } } } signed main() { //ios::sync_with_stdio(false); //cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //expr(); //int t; cin >> t; rep(i, t) //while (cin >> n >> m>>s1>>s2>>t, n) solve(); return 0; }