/**
 * 
 */
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.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class ProblemB {
	public static void main(String[] args) throws FileNotFoundException {
		PrintStream out = new PrintStream(new FileOutputStream(new File(
				"b-small.out")));
		Scanner in = new Scanner(new File("B-small-attempt0.in"));

		int T = in.nextInt();

		for (int i = 1; i <= T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();

			int defCount = 0;
			int surpCount = 0;
			for (int j = 0; j < N; j++) {
				int t = in.nextInt();

				if (t % 3 == 0) { // (1,1,1) <-> (0,1,2)
					if (t / 3 >= p)
						defCount++;
					else if (t / 3 >= p - 1 && t / 3 >= 1) // (0,0,0) cannot change
						surpCount++;
				}
				if(t % 3 == 1){ // (0,0,1) -> no way to increase max score
					if(t / 3 >= p - 1) // int div
						defCount++;
				}
				if(t % 3 == 2){ // (0,1,1) <-> (0,0,2)
					if(t / 3 >= p - 1) // int div
						defCount++;
					else if(t / 3 >= p - 2)
						surpCount++;
				}
				
				//System.out.printf("total: %d, avg: %d, dC: %d, sC: %d\n", t, t/3, defCount, surpCount);
			}
			
			out.printf("Case #%d: %d\n", i, defCount + Math.min(surpCount, S));
			
			//System.out.printf("\n\n");
		}

		in.close();
		out.close();
	}
}
