/**
 * 
 */
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.BufferedReader;
import java.io.FileReader;
import java.util.LinkedList;
import java.util.StringTokenizer;


public class GoogleDance {
	
	public static void main(String args[]) throws Exception{
		String line = "";
		BufferedReader br =	new BufferedReader(new FileReader("/Users/ravipalacherla/Documents/workspace/CodeJam/src/input.txt"));
		int T = Integer.parseInt(br.readLine());
		int answer = 0, j =0;
		while((line = br.readLine()) != null) {
			StringTokenizer st = new StringTokenizer(line," ");
			while(st.hasMoreTokens()) {
				int N = Integer.parseInt(st.nextToken());
				int S = Integer.parseInt(st.nextToken());
				int p = Integer.parseInt(st.nextToken());
				int usedS = 0;
				int result = 0;
				//LinkedList<Integer> totalPoints = new LinkedList<Integer>();
				for(int i =0;i<N;i++) {
					//totalPoints.add(Integer.parseInt(st.nextToken()));
					int totalPoint = Integer.parseInt(st.nextToken());
					if(totalPoint < p) {
						continue;
					}
					if(p <= 0) {
						result++;
						continue;
					}
					if(totalPoint >= p+(2*(p-1))) {
						result++;
					} else if ( totalPoint >= p+(2*(p-2)) && totalPoint < p+(2*(p-1)) && usedS < S) {
						usedS++;
						result++;
					}
				}
				j++;
				System.out.println("Case #"+ j +": "+result);
			}
		}
		
	}

}
