/**
 * 
 */
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.*;
import java.util.*;

public class B {
	public static final String INPATH = "input2.in";
	public static final String OUTPATH = "output2.out";

	public static void main (String[] args) throws FileNotFoundException {
		Scanner inscan = new Scanner (new File (INPATH));
 		PrintStream out = new PrintStream (new File (OUTPATH));
		
		int T = inscan.nextInt();
		inscan.nextLine();
		
		for (int i=1; i <= T; i++) {
			int result = compute (inscan.nextLine());
			out.println("Case #" + i + ": " + result);
		}
	}
	
	public static int compute (String line) {
		Scanner linescan = new Scanner (line);
		int N = linescan.nextInt();
		int S = linescan.nextInt();
		int p = linescan.nextInt();
		
		if (p == 0) {
			return N;
		}
		
		int count = 0;
		for (int i=0; i < N; i++) {
			int t = linescan.nextInt();
			
			if (t >= 3*p - 2) {
				count++;
			} else if (3*p - 4 <= t && t <= 3*p - 3 && S > 0 && !(p == 1 && t == 0)) {
				count++;
				S--;
			}
		}
		
		return count;
	}

}