import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}


package codejam;

import java.io.*;

public class DancingWithTheGooglers {

    private BufferedReader br;
    private BufferedWriter wr;
    
    public DancingWithTheGooglers(String filein,String fileout){
        try{
            br = new BufferedReader(new 
                    InputStreamReader(new FileInputStream(filein)));
            wr = new BufferedWriter(new FileWriter(fileout));
            
            int num = 0;
            num = Integer.parseInt(br.readLine());
            
            for (int i = 1;i<=num;i++){
                String buf = br.readLine();
                String[] bufarray = buf.split(" ");
                int n = Integer.parseInt(bufarray[0]);
                int s = Integer.parseInt(bufarray[1]);
                int p = Integer.parseInt(bufarray[2]);
                int numgood = 0;
                for (int j = 3;j<bufarray.length;j++){
                    int now = Integer.parseInt(bufarray[j]);
                    
                    int div = now/3;
                    int mod = now%3;
                    
                    switch(mod){
                        case 0:
                            if (div >= p){
                                numgood++;
                            }else if (s > 0 && div > 0 && div+1 >= p){
                                numgood++;
                                s--;
                            }
                            break;
                        case 1:
                            if (div >= p || div+1 >= p){
                                numgood++;
                            }
                            break;
                        case 2:
                            if (div >= p || div+1 >= p){
                                numgood++;
                            }else if (s > 0 && div+2 >= p){
                                numgood++;
                                s--;
                            }
                            break;
                    }
                }
                String out = "Case #"+i+": "+numgood;
                wr.write(out);
                if (i != num)
                    wr.newLine();
            }
            
            br.close();
            wr.close();
        }catch (IOException e){
            System.out.println("IO failure");
        }
    }
    
    public static void main(String[] args) {
        DancingWithTheGooglers sp = new DancingWithTheGooglers("B-large.in","B-large.out");
    }
}
