/**
 * 
 */
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.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class dancers {
	public static void main(String[] args) {
		try {
			Scanner input = new Scanner(new File("c:\\files\\B-small-attempt0.in"));
			FileWriter fw =  new FileWriter("c:\\files\\douts.txt");
			PrintWriter output = new PrintWriter(fw);
			int n = input.nextInt();
			for(int i=0;i<n;i++)
			{
				
				int noD = input.nextInt();
				int surprise = input.nextInt();
				int points = input.nextInt();
				
				int total[] = new int[noD];
				int count = 0;
				
				for(int j=0;j<noD;j++)
					total[j]=input.nextInt();
				
				for(int j=0;j<noD-1;j++)
					for(int k=j+1;k<noD;k++)
						if(total[j]<total[k])
						{
							int temp=total[j];
							total[j]=total[k];
							total[k]=temp;
						}
				
				for(int dIndex=0;dIndex<noD;dIndex++)
				{
					if(total[dIndex]>=3*points-2)
						count++;
					else if(surprise>0 && (total[dIndex]==3*points-3 || total[dIndex]==3*points-4) && total[dIndex]>0)
					{
						surprise--;
						count++;
					}
					else
						break;
				}
				output.println("Case #"+(i+1)+": "+count);
			}
			output.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
