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

public class DancingGooglers {
	public static void main( String args[] ) {
		new DancingGooglers();
	}
	
	public DancingGooglers() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		
		for( int j=0; j<T; j++ ) {
			System.out.println( "Case #"+ (j+1) + ": " + doCase(sc) );
		}
	}
	
	public int doCase( Scanner sc ) {
		int N = sc.nextInt();
		int S = sc.nextInt();
		int p = sc.nextInt();
		
		int naturalP    = 0;
		int surprisingP = 0;
		for( int j=0; j<N; j++ ) {
			int points = sc.nextInt();
			
			if( p + Math.max(p-1,0) + Math.max(p-1,0) <= points )
				naturalP++;
			else if( p + Math.max(p-2,0) + Math.max(p-2,0) <= points )
				surprisingP++;
		}
		
		return naturalP + Math.min(surprisingP, S);
	}
}
