from sys import stdin

inf = 10**15 + 1

def calc_comb(n, k, comb):
    if k > n - k:
        k = n - k

    if comb[n][k] > 0:
        return comb[n][k]

    if k == 0 or k == n:
        comb[n][k] = 1
        return comb[n][k]

    comb[n][k] = min(inf, calc_comb(n - 1, k - 1, comb) + calc_comb(n - 1, k, comb))
    return comb[n][k]

def solve():
    comb = [[0]*(3000 + 1) for i in range(3000 + 1)]
    inf = 10**15 + 1

    Q = int(stdin.readline())

    for q in range(Q):
        d, x, t = map(int, stdin.readline().split())
        c = calc_comb(x + d - 1, d - 1, comb)

        if c > t:
            print('ZETUBOU')
        else:
            print('AC')

if __name__ == '__main__':
    solve()