#include using namespace std; #define rep(i,n) for(int i=0;i<(n);++i) #define loop for(;;) #define trace(var) cerr<<">>> "<<#var<<" = "< inline ostream& operator<<(ostream&os, pair p) { return os << '(' << p.first << ", " << p.second << ')'; } template inline ostream& operator<<(ostream&os, tuple t) { return os << '(' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << ')'; } template inline ostream& operator<<(ostream&os, vector v) { if (v.size() == 0) { return os << "(empty)"; } os << v[0]; for (int i=1, len=v.size(); i inline istream& operator>>(istream&is, vector&v) { rep (i, v.size()) is >> v[i]; return is; } // ^ > v < int dx[] = { -1, 0, 1, 0 }; int dy[] = { 0, 1, 0, -1 }; using vi = vector; using vvi = vector; using vd = vector; using vvd = vector; using vb = vector; tuple ex_gcd(int x, int y) { int r0 = x, a0 = 1, b0 = 0; for (int r = y, a = 0, b = 1; r > 0; ) { int r2 = r0 % r; int a2 = a0 - r0 / r * a; int b2 = b0 - r0 / r * b; r0 = r; r = r2; a0 = a; a = a2; b0 = b; b = b2; } return make_tuple(a0, b0, r0); } int mod_inv(int a, int m) { auto r = ex_gcd(a, m); if (get<2>(r) != 1) throw; int b = get<0>(r); while (b < 0) b += m; return b; } // }}} long comb(long n, long k) { const long M = 1000000007; // k = min(k, n - k); if (k == 0) return 1; if (k == 1) return n % M; long r = comb(n - 1, k - 1); r *= n; r %= M; long v = mod_inv(k, M); v %= M; r *= mod_inv(k, M);; r %= M; return r; } int main() { cin.tie(0); ios::sync_with_stdio(0); cout.setf(ios::fixed); cout.precision(10); random_device dev; mt19937 rand(dev()); int q; cin >> q; while (q--) { int d, x, t; cin >> d >> x >> t; int a = comb(d+x-1, x); cout << ( (a <= t) ? "AC" : "ZETUBOU" ) << endl; } return 0; }