/**
 * 
 */
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 B_Dancing {

	static boolean enoughNonSurprising(int p, int score) {
		return score >= 3*p-2;
	}
	static boolean enoughSurprising(int p, int score) {
		return score >= 3*p-4;
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		boolean firstline = true;
		for (int cas = 1; cas <= T; cas++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int enoughNS = 0;
			int enoughS = 0;
			for (int i = 0; i < N; i++) {
				int score = in.nextInt();
				if (enoughNonSurprising(p,score))
					enoughNS++;
				else if (p > 1 && enoughS < S && enoughSurprising(p,score))
					enoughS++;
			}
			if (firstline)
				firstline = false;
			else
				System.out.println();
			System.out.print("Case #"+cas+": "+(enoughNS+enoughS));
		}
	}

}
