/**
 * 
 */
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 q2Alt{
public static void main (String[] args) throws IOException 
    {
	BufferedReader input = new BufferedReader (new FileReader ("B-small-attempt0.txt"));
	PrintWriter output = new PrintWriter (new FileWriter("test2DoneAlt.out"));
	StringTokenizer st;
	
	int numOfLine = Integer.parseInt(input.readLine());
	for(int i = 0; i < numOfLine; i++){
	    st = new StringTokenizer(input.readLine());
	    int N = Integer.parseInt(st.nextToken());
	    int S = Integer.parseInt(st.nextToken());
	    int P = Integer.parseInt(st.nextToken());
	    int better = 0;
	    int[] scores = new int [N];
	    
	    for(int j = 0; j < N; j++){
		scores[j] = Integer.parseInt(st.nextToken());
	    }
	    
	    for(int j = 0; j < N; j++){
		int reduction = scores[j] - P;
		if(reduction < 0){}
		else if(reduction >= 2*(P - 1)){
		    better ++;
		}
		else if(reduction >= 2*(P-2) && S > 0){
		    better ++;
		    S --;
		}
	    }
	    
	    output.println("Case #" + (i+1) + ": " + better);
	}
	output.close();
    }
}          
