#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

ll comb(int n, int r, int t){
    vector<vector<ll>> c(n+1, vector<ll>(n+1)); 
    for (int i = 1; i <= n; i++){
        c[i][0] = 1;
        c[i][i] = 1;
        for (int j = 1; j < i; j++){
            if (j < r && c[i][j-1] > t){
                return c[i][j-1];
            }
            if (j == 1) c[i][j] = i;
            else c[i][j] = c[i-1][j-1] + c[i-1][j];
        }
    }
    return c[n][r];
}

int main()
{
    int q;
    cin >> q;
    for (int i = 0; i < q; i++){
        ll d, x, t;
        bool ac = false;
        cin >> d >> x >> t;
        if (d == 1){
            if (t >= 1) ac = true;
        } else {
            if (t >= comb(d+x-1, d-1, t)) ac = true;
        }
        if (ac) cout << "AC" << endl;
        else cout << "ZETUBOU" << endl;
    }
}