#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 REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;



int main()
{
    int n;
    int d = 0,x = 0,t = 0;
    static ll dp[1503][1503];
    vector<string> ans;
    cin >> n;
    rep(i,1501)
    {
        dp[0][i] = 1;
        dp[i][0] = 1;
    }
    rep(i,1501)
    {
        rep(j,1501)
        {
            if (dp[i][j+1] > 1e15 || dp[i+1][j] > 1e15)
            {
                 dp[i+1][j+1] = 1e16;
            }
            else
            {
                dp[i+1][j+1] = dp[i][j+1] + dp[i+1][j];
            }
        }
    }

    for (int i = 0; i < n; i++)
    {
        cin >> d >> x >> t;
        if (dp[x][d-1] <= t)
        {
            ans.push_back("AC");
        }
        else
        {
            ans.push_back("ZETUBOU");
        }
    }
    for (int i = 0; i < n; i++)
    {
        cout << ans[i] << endl;
    }

    return 0;
}