import java.util.*;

public class Exercise120{
  public static void main (String[] args){

    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();

	    long[][] each = new long[n][3];
	    long max = 0;
	    for(int i = 0; i < n; i++){
	      each[i][0] = sc.nextLong();
	      each[i][1] = sc.nextLong();
	      each[i][2] = sc.nextLong();
	      max = Math.max(max, each[i][1] + each[i][0] - 1);
	    }
	    long[][] dp = new long[(int)max + 1][(int)max + 1];
	    for(int i = 0; i <= max; i++){
	      for(int j = 0; j <= i; j++){
	        if(j == 0 || j == i){
	          dp[i][j] = 1;
	        }else{
	          dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
	        }
	      }
	    }
	    for(int i = 0; i < n; i++){
	      if(dp[(int)each[i][1] + (int)each[i][0] - 1][(int)each[i][1]] > each[i][2] || dp[(int)each[i][1] + (int)each[i][0] - 1][(int)each[i][1]] < 0){
	        System.out.println("ZETUBOU");
	      }else{
	        System.out.println("AC");
	      }
	    }
	  }
	}