/**
 * 
 */
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;

/*
 * Google Code Jam 2012
 * Program by Tommy Ludwig
 * Problem: Dancing With the Googlers
 * Date: 2012-04-13
 */


public class dancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T, N, S, p;
		T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int y = 0;
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			int [] t = new int[N];
			
			for (int j = 0; j < N; j++) 
				t[j] = in.nextInt();
			
			//minimum number with surprise case
			int minNumS = (3 * p) - 4;
			if (minNumS < 2) minNumS = 2;
			//minimum number without surprise case
			int minNum = (3 * p) - 2;
			//if (minNum < 0) minNum = 0;
			
			for (int j = 0; j < N; j++) {
				if (t[j] >= minNum)
					y++;
				else if (t[j] >= minNumS && S > 0) {
					y++;
					S--;
				}
			}
			System.out.printf("Case #%d: %d\n", i, y);
		}
	}

}
