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

public class Googlers {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("resource/B-small-attempt2.in"));
		int T = sc.nextInt(); 
		int i = 1;
		while (i<=T) {
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int t[] = new int[N];
			for(int j=0; j<N; j++){
				t[j] = sc.nextInt();
			}
			System.out.println("Case #"+i+": "+process(N, S, p, t));
			i++;
		}
	}
	private static int process(int n, int s, int p, int[] t) {
		int counter = 0;
		if(p==0) return t.length;
		for(int i=0; i<n; i++){
			if( t[i] <= 3*((p-2)>=0? (p-2): 0) + 1) {
				//Never happen
				continue;
			}
			else if(t[i] >= 3 * p - 2){
				//Not surprising
				counter++;
		    }
			else {
				//Surprising
				if(s>0){
					s--;
					counter++;
				}
			}
		}
		return counter;
	}
}
