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

public class ProbB {
	
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in).useDelimiter("\n");
		
		int t = s.nextInt();
		String[] lines = new String[t];
		
		for(int i = 0; i < t; i++) {
			lines[i] = s.next();
		}
		
		s.close();
		
		for(int i = 0; i < t; i++) {
			//System.out.println(lines[i]);
			System.out.println("Case #" + (i+1) + ": " + solve(lines[i]));
		}
	}
	
	private static int solve(String ln) {
		Scanner s2 = new Scanner(ln);
		
		int n = s2.nextInt(); // Number of Googlers
		int s = s2.nextInt(); // Number of surprising cases
		int p = s2.nextInt(); // result of at least p?
		int[] tPoints = new int[n]; // array of each Googler's total points
		
		for(int i = 0; i < n; i++) {
			tPoints[i] = s2.nextInt();
			//System.out.println(tPoints[i]);
		}
		
		s2.close();
		
		int total = 0;
		int firstChk = Math.max(3*p - 2, p);
		int scdChk = Math.max(3*p - 4, p);
		
		for(int i = 0; i < n; i++) {
			
			if(tPoints[i] >= firstChk) {
				total++;
				continue;
			}
			else if((tPoints[i] >= scdChk) && (s > 0)) {
				total++;
				s--;
				continue;
			}
		}
		
		return total;
	}

}
