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

	}

}

/*
 * Anand Oza
 * Apr 14, 2012
 */

import java.util.*;
import java.io.*;

public class B_DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		long startTime = System.nanoTime();
		BufferedReader reader = new BufferedReader(new FileReader("B_DancingWithTheGooglers.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B_DancingWithTheGooglers.out")));
		StreamTokenizer in = new StreamTokenizer(reader);

		in.nextToken();
		int T = (int) in.nval;
		for (int testcase = 1; testcase <= T; testcase++) {
			in.nextToken();
			int N = (int) in.nval;
			in.nextToken();
			int S = (int) in.nval;
			in.nextToken();
			int P = (int) in.nval;
			int unsurprisingThreshold = 2 * Math.max((P - 1), 0) + P;
			int surprisingThreshold = 2 * Math.max((P - 2), 0) + P;
			int countUnsurprising = 0;
			int countSurprising = 0;
			for (int i = 0; i < N; i++) {
				in.nextToken();
				int t = (int) in.nval;
				if (t >= unsurprisingThreshold)
					countUnsurprising++;
				else if (t >= surprisingThreshold)
					countSurprising++;
			}

			int ans = countUnsurprising + Math.min(S, countSurprising);
			out.format("Case #%d: %d%n", testcase, ans);
		}

		out.close();
		System.out.println("Time (ms): " + (double) (System.nanoTime() - startTime) / 1000000);
		System.exit(0);
	}
}
