from sys import stdin

inf = 10**15 + 1

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

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

        for k in range(1, n // 2 + 1):
            comb[n][k] = min(inf, comb[n - 1][min(k, n - 1 - k)]
                                    + comb[n - 1][min(k - 1, n - k)])
            
    Q = int(stdin.readline())

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

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

if __name__ == '__main__':
    solve()