/**
 * 
 */
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.*;
public class Main {
	public static void main(String[] args) throws Exception{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int cases=Integer.parseInt(in.readLine());
		for(int i=1;i<=cases;i++)
		{
			String line = in.readLine();
			String parts[] = line.split(" ");
			int out = 0;
			int n = Integer.parseInt(parts[0]);
			int s = Integer.parseInt(parts[1]);
			int p = Integer.parseInt(parts[2]);
			int count = 0;
			int marks[] = new int[n];
			for(int j=0;j<n; j++){
				marks[j] = Integer.parseInt(parts[3+j]);
			}
			if(p == 0){
				count = n;
				System.out.println("Case #"+i+": "+count);
				continue;
			}
			else{
				for(int j = 0 ; j < n ; j++){
					if(marks[j] != 0){
						if(marks[j] >= 3*p){
							count++;
							continue;
						}
						else if(marks[j] == ((3*p)-2)){
							count++;
							continue;
						}
						else if(marks[j] == ((3*p)-1)){
							count++;
							continue;
						}
						else if((marks[j] == ((3*p)-3) )||(marks[j] == ((3*p)-4))){
							if(s>0){
								s--;
								count++;
							}
						
						}
						}
					}
					System.out.println("Case #"+i+": "+count);
				}
			}
			
		}

	}


