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

public class dancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scan = new Scanner(System.in);
		int numStrings = scan.nextInt();
		
		for(int i =1; i <= numStrings; i++){
			int numGooglers = scan.nextInt();
			int numSurprises = scan.nextInt();
			int p = scan.nextInt();
			
			int[] totalScores;
			totalScores = new int[numGooglers];
			
			int withoutSurpriseCount, withSurpriseCount;
			withoutSurpriseCount = 0 ;
			withSurpriseCount = 0;
			
			for(int j = 1; j <= numGooglers; j++){
				
				totalScores[j-1] = scan.nextInt();
				
				if(totalScores[j-1] >= p + 2*Math.max(p-1, 0)){
					withoutSurpriseCount = withoutSurpriseCount + 1;
				}
				else if(totalScores[j-1] >= p + 2*Math.max(p-2,0)){
					withSurpriseCount = withSurpriseCount + 1;
				}
			}
			
			//System.out.println("\n " + numGooglers + " " + numSurprises + " " + withoutSurpriseCount + " " + withSurpriseCount);
			
			int temp1 = Math.min(withSurpriseCount, numSurprises);
			int temp2 = temp1 + withoutSurpriseCount;
			int temp3 = Math.min(numGooglers, temp2);
			
			System.out.format("Case #%d: %d\n", i, temp3);
		
		}
	}

}
