/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class DancingWithGooglers_1B_QualGCJ12 {
	public static void main(String[] args) {
		try{
			BufferedReader br = new BufferedReader(new FileReader("E:\\Code\\Algorithmz\\src\\myFiles\\B-small-attempt0.in"));
			BufferedWriter bw = new BufferedWriter(new FileWriter("E:\\Code\\Algorithmz\\src\\myFiles\\B-small-attempt0.out"));
			int T=Integer.parseInt(br.readLine());
			for(int currTest=1;currTest<=T;currTest++){
				String currentTestCase[] = br.readLine().split(" ");
				int N=Integer.parseInt(currentTestCase[0]);
				int S=Integer.parseInt(currentTestCase[1]);
				int p=Integer.parseInt(currentTestCase[2]);
				int possibleCount=0;
				for(int currentDancer=3,totalDancers=currentTestCase.length;currentDancer<totalDancers;currentDancer++){
					int currentTotal=Integer.parseInt(currentTestCase[currentDancer]);
					if(currentTotal<p)
						continue;
					if(currentTotal>=(3*p - 2))
						possibleCount++;
					else if (currentTotal>=(3*p -4) && --S>=0)
						possibleCount++;
				}
				bw.write("Case #"+(currTest)+": " +  possibleCount+"\n");
			}
			bw.close();
		}catch(Exception e){
			e.printStackTrace();
		}
		System.err.println("Done");
	}

}
