from sys import stdin

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

    for n in range(3000 + 1):
        comb[n][0] = comb[n][n] = 1

        for k in range(1, n):
            comb[n][k] = min(inf, comb[n - 1][k] + comb[n - 1][k - 1])

    Q = int(stdin.readline())

    for q in range(Q):
        d, x, t = map(int, stdin.readline().split())

        if comb[d + x - 1][d - 1] > t:
            print('ZETUBOU')
        else:
            print('AC')

if __name__ == '__main__':
    solve()