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

public class googlers {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {

		Scanner fe = new Scanner(new FileInputStream(
				"/home/gllera/Desktop/data.in"));
		FileWriter fs = new FileWriter("/home/gllera/Desktop/data.out");

		int cases = fe.nextInt();

		for (int i = 0; i < cases; i++) {
			int n = fe.nextInt();
			int s = fe.nextInt();
			int p = fe.nextInt();

			int sol = 0;

			for (int j = 0; j < n; j++) {
				int num = fe.nextInt();

				if (num == 0) {
					if (p == 0)
						sol++;

					continue;
				}

				if (num / 3 >= p) {
					sol++;
					continue;
				}

				if (num % 3 != 0)
					if (num / 3 + 1 >= p) {
						sol++;
						continue;
					}

				if (num % 3 != 1)
					if (s != 0)
						
						if (num % 3 != 0) {
							
							if (num / 3 + 2 >= p) {
								sol++;
								s--;
							}
							
						} else {
							
							if (num / 3 + 1 >= p) {
								sol++;
								s--;
							}
							
						}
			}

			fs.write("Case #" + (i + 1) + ": " + sol + '\n');
		}

		fe.close();
		fs.flush();
		fs.close();
	}

}
