#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

const long long INF = 1e15 + 1;

long long combination(int n, int r) {
    r = min(r, n - r);
    long long val = 1;
    for (int i = 1; i <= r; i++) {
        val *= n + 1 - i;
        val /= i;

        if (val >= INF) {
            return INF;
        }
    }

    return val;
}

int main() {
    int q, d, x;
    long long t;

    cin >> q;
    vector<bool> ok(q);
    for (int i = 0; i < q; i++) {
        cin >> d >> x >> t;
        d--;
        ok[i] = (combination(d + x, x) <= t);
    }

    for (int i = 0; i < q; i++) {
        cout << (ok[i] ? "AC" : "ZETUBOU") << endl;
    }
    return 0;
}