/**
 * 
 */
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 QualB {
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int z = Integer.parseInt(br.readLine());
		int[] u = {0, 0, 3, 6, 9, 12, 15, 18, 21, 24, 27};
		int[] ul = {0, 0, 1, 4, 7, 10, 13, 16, 19, 22, 25};
		
		
		for(int i=0; i<z; i++){
			String[] s = br.readLine().split("\\s+");
			
			int n = Integer.parseInt(s[0]);
			int ss = Integer.parseInt(s[1]);
			int p = Integer.parseInt(s[2]);
			
			int l = 3 + n;
			int index = 0;
			
			int[] arr = new int[n];
			
			for(int j=3; j<l; j++){
				arr[index] = Integer.parseInt(s[j]);
				index++;
			}
			
			if(p == 0){
				System.out.println("Case #" + (i+1) + ": " + n);
			}else{
				int ctr = 0;
				
				for(int j=0; j<n; j++){
					int t = arr[j];
					
					if(t > u[p]){
						ctr++;
						
					}else if(t > ul[p] && ss > 0){
						ss--;
						ctr++;
					}
				}
				
				System.out.println("Case #" + (i+1) + ": " + ctr);
			}
		}
	}
}
