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 codejam2012.B;

import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author Rymbu VV
 */
public class DancingWithGooglers {

    private Scanner sc;
    private PrintWriter pw;
    private int CASES;
    
    public static void main(String[] args) {
        DancingWithGooglers suk = new DancingWithGooglers("c:\\bl.in", "c:\\bl.out");
        suk.execute();
    }
    
    public DancingWithGooglers(String fileIn, String fileOut) {
        try{
            sc = new Scanner(new File(fileIn));
            pw = new PrintWriter(new FileWriter(fileOut));
            CASES = sc.nextInt();
        }catch(Exception e){System.out.println("In Constructor "+e);}
    }
    
    public void execute(){
        int N, S, p, count;
        for(int ncase = 1; ncase <= CASES; ncase++){
            pw.print("Case #"+ncase+": ");
            
            N = sc.nextInt();
            S = sc.nextInt();
            p = sc.nextInt();
            count = 0;
            for (int i=0; i<N; i++){
                int t = sc.nextInt();
                if (t>=p && (t/3) >= p ){
                    count++;
                    continue;
                }
                int tmp = t-p;
                if (t>=p && (p-(tmp/2)) <= 1){
                    count++;
                    continue;
                }
                if (S>0 && t>=p && (p-(tmp/2)) <= 2){
                    count++;
                    S--;
                }
            }
            
            pw.println(count);
        }
        pw.flush();
        pw.close();
        sc.close();
    }
}
