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.qualification;

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


public class DancingWithTheGooglers {
	static String dir="/home/casatta/Scaricati/";
//	static String dir="data/";
	
	static String fname="B-large.in";
//	static String fname="DancingWithTheGooglers";
	
	
	public void test(Scanner input, PrintWriter out, Long i) {
		int n=input.nextInt();
		int surprising=input.nextInt();
		int p=input.nextInt();
		
		int max=p*3;
		int notSurprising=max-2;
		int isSurprising=max-4;
		int count=0;
		int current;
		
		System.out.println("n=" + n + " surprising=" + surprising + " p=" + p );
		System.out.println("max=" + max + " notSurprising=" + notSurprising + " isSurprising=" + isSurprising );
		
		
		for(int j=0;j<n;j++) {
			current=input.nextInt();
			System.out.print(" " + current);
			if(current>=notSurprising)
				count++;
			else if(current>=isSurprising && surprising>0 && current>=p) {
				count++;
				surprising--;
			}
		}
		
		
		
		
		System.out.println();
		
		String result = "Case #" + (i+1) + ": " +count;
		out.println(result);
		System.out.println(result);
		System.out.println();
	}
	
	
	public void run() {
			
		
		try {
			String inputPath = dir + fname;

			Scanner input =new Scanner(new File(inputPath));
			FileWriter outFile = new FileWriter(inputPath + ".out");
			PrintWriter out = new PrintWriter(outFile);
			try {		
				Long testCases = input.nextLong();
				input.nextLine();

				for(Long i=0L ; i < testCases ; i++)
					test(input,out,i);
			}
			finally {
				input.close();
				out.close();
			}
		}
		catch (IOException ex){
			ex.printStackTrace();
		}
	}
	
	public static void main(String[] args) {
		DancingWithTheGooglers template = new DancingWithTheGooglers();
		template.run();
	}
	

}
