import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {
	
	public static long naive_solve(final int deep, final int T, final int X){
		if(deep >= T){
			return 1;
		}
		
		long ret = 0;
		for(int i = 0; i <= X; i++){
			ret += naive_solve(deep + 1, T, X - i);
		}
		
		return ret;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final int N_MAX = 3000;
		final int M_MAX = 1500;
		
		long[][] nCk = new long[N_MAX + 1][M_MAX + 1];
		nCk[0][0] = 1;
		for(int i = 1; i <= N_MAX; i++){
			for(int j = 0; j <= Math.min(i, M_MAX); j++){
				if(j != i){ 
					nCk[i][j] += nCk[i - 1][j];
				}
				
				if(j != 0){
					BigInteger big = BigInteger.valueOf(nCk[i][j]);
					big = big.add(BigInteger.valueOf(nCk[i - 1][j - 1]));

					if(big.compareTo(BigInteger.valueOf(Long.MAX_VALUE)) >= 0){
						nCk[i][j] = Long.MAX_VALUE;
					}else{
						nCk[i][j] += nCk[i - 1][j - 1];
					}
				}
			}
		}
		
		final int Q = sc.nextInt();
		for(int q = 0; q < Q; q++){
			final int D = sc.nextInt();
			final int X = sc.nextInt();
			final long T = sc.nextLong();
			
			final long comb = nCk[D + X - 1][X];
			//System.out.println(comb);
			
			System.out.println(comb <= T ? "AC" : "ZETUBOU");
		}
	}

}