Q = int(input())
M = 3005
comb = [[1] * M for i in range(M)]
inf = 10 ** 18
for i in range(1, M):
    for j in range(1, i):
        comb[i][j] = min(inf, comb[i-1][j] + comb[i-1][j-1])

for _ in range(Q):
    D, X, T = map(int, input().split())
    print("AC") if comb[X + D - 1][D - 1] <= T else print("ZETUBOU")