/**
 * 
 */
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.PrintWriter;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner reader = new Scanner(new File("B-small-attempt1.in"));
		PrintWriter writer = new PrintWriter(new File("output.txt"));
		int cases = reader.nextInt();
		for (int i=0; i<cases; i++) {
			int N = reader.nextInt();
			int S = reader.nextInt();
			int P = reader.nextInt();
			int[] G = new int[N];
			int X = 0;
			int K = 0;
			for (int j=0; j<N; j++) {
				G[j] = reader.nextInt();
				int score = G[j];
				int base =  (int) Math.ceil(G[j] /3);
				switch (score % 3) {
				case 0:
					if (base >= P) {
						X++;
					} else if (K < S && base > 0 && (base + 1) >= P) {
						K++;
						X++;
					}
					break;
				case 1:
					if (base >= P || (base + 1) >= P) {
						X++;
					} else if (K < S && (base + 1) >= P) {
						K++;
						X++;
					}
					break;
				case 2:
					if ((base + 1) >= P || base >= P) {
						X++;
					} else if (K < S && (base + 2) >= P) {
						K++;
						X++;
					}
					break;
				}
			}
			writer.println("Case #" + (i+1) + ": " + X);
		}
		System.out.println("done");
		reader.close();
		writer.close();
	}

}
