/**
 * 
 */
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.util.*;
import java.io.*;
public class Sol2 {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-small-attempt0.in"));
		System.setOut(new PrintStream(new File("B-small-attempt0.out")));
		int len = sc.nextInt();
		for (int i = 0; i < len; i++) {
			int nexlen = sc.nextInt();
			int surp = sc.nextInt();
			int minscore = sc.nextInt();
			int numb = 0;
			for (int a = 0; a < nexlen; a++) {
				int[] three = separate(sc.nextInt());
				if (isGood(three, minscore)) {
					numb++;
				} else {
					if (((three[0]==three[1]&&three[1]==three[2]&&three[0]!=0)||(three[0]==three[1]&&three[1]-1==three[2]))&&surp>0) {
						if (three[0]+1>=minscore) {
							numb++;
							surp--;
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+numb);
		}
	}
	public static int[] separate(int i) {
		int[] ret = new int[3];
		ret[0] = (int)Math.ceil(i/3.);
		ret[1] = (int)Math.ceil((i-ret[0])/2.);
		ret[2] = i-ret[0]-ret[1];
		return ret;
	}
	public static boolean isGood(int[] in,int a) {
		for (int i = 0; i < 3; i++) {
			if (in[i]>=a) {
				return true;
			}
		}
		return false;
	}
}