TMAX = 10 ** 15
dp = [[0] * 3010 for i in range(1510)]
for i in range(1510):
    dp[i][0] = 1
for i in xrange(1, 1501):
    for j in xrange(1, i+1):
        p = dp[i-1][j-1]
        q = dp[i-1][j]
        if p < 0 or q < 0 or p + q > TMAX:
            dp[i][j] = -1
        else:
            dp[i][j] = p + q

def solve():
    D, X, T = map(int, raw_input().strip().split())
    z = dp[X+D-1][D-1]
    if z < 0 or z > T:
        return "ZETRUBOU"
    else:
        return "AC"

Q = input()
for i in range(Q):
    print(solve())