#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;
using ll = long long;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int Q;
    ll D[10007];
    ll X[10007];
    ll T[10007];

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

    for (int i = 0; i < Q; i++) {
        ll prev[1507] = {};
        ll cur[1507] = {};
        prev[0] = 1;

        for (int j = 0; j < D[i]; j++) {
            cur[0] = 1;
            for (int s = 1; s <= X[i]; s++) {
                cur[s] = prev[s] + cur[s-1];
            }
            for (int s = 0; s <= X[i]; s++) {
                prev[s] = cur[s];
            }
            if (cur[X[i]] > T[i]) {
                goto zetubou;
            }
        }

        if (cur[X[i]] <= T[i]) {
            cout << "AC" << endl;
        } else {
zetubou:
            cout << "ZETUBOU" << endl;
        }
    }

    return 0;
}