import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        new Main();
    }

    public Main() {
        for(int i=0;i<memo.length;i++)
            Arrays.fill(memo[i], -1);

        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        for(int i=0;i<q;i++){
            D = sc.nextInt();
            X = sc.nextInt();
            T = sc.nextLong();
            System.out.println(solve());
        }
    }

    long[][] memo = new long[2000][2000];
    int D;
    int X;
    long T;
    private String solve(){
        long c = rec(D-1, X);
        if(c>T)
            return "ZETUBOU";
        else
            return "AC";
    }

    private long rec(int n, int cur){
        if(memo[n][cur]>=0){
            return memo[n][cur];
        }

        if(n==0){
            memo[n][cur] = 1;
            return memo[n][cur];
        }

        long c = 1;
        for(int i=0;i<=cur;i++){
            c += rec(n-1, i);

            if(c>T){
                c= T+1;
            }
            memo[n][i] = c;
        }

        return memo[n][cur];
    }
}