#include <algorithm>
#include <array>
#include <sstream>
#include <cstdio>
#include <functional>
#include <cstdlib>
#include <cctype>
#include <ostream>
#include<complex>
#include <cmath>
#include <iostream>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <bitset>
#include <iomanip>
#include <string>
#include <vector>
#include <string>

using namespace std;
#define OB (bitset<32>)
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define ALLOF(c) begin(), (c),end()

typedef long long ll;

#define PI acos(-1)
#define EPS 1e-11
#define MOD 1000000007

int main()
{
    int n;
    int d,x,t;
    int dp[1503][1503];
    fill(*dp,*dp + 1503*1503,0);
    vector<string> ans;
    cin >> n;
    rep(i,1501)
    {
        dp[0][i] = 1;
        dp[i][0] = 1;
    }
    rep(i,1500)
    {
        rep(j,1500)
        {
            if (dp[i][j+1] > 150000 || dp[i+1][j] > 150000)
            {
                 dp[i+1][j+1] = 200000;
            }
            dp[i+1][j+1] = dp[i][j+1] + dp[i+1][j];
        }
    }
    rep(i,n)
    {
        cin >> d >> x >> t;
        if (dp[x][d - 1] <= t)
        {
            ans.push_back("AC");
        }
        else
        {
            ans.push_back("ZETUBOU");
        }
    }
    rep(i,ans.size())
    {
        cout << ans[i] << endl;
    }
    return 0;
}