/**
 * 
 */
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.StringTokenizer;
public class DancingWithGooglers extends BaseSolution {
	public String solveTestCase() throws Exception {
		String inp = readLine();
		StringTokenizer st = new StringTokenizer(inp);
		int N = Integer.parseInt(st.nextToken());
		int S = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		int ans=0;
		for(int i=0;i<N;i++){
			int t = Integer.parseInt(st.nextToken());
			int maxNormal=t,maxSurprise=t;
			if(t>0){
				maxNormal = ((t-1)/3) + 1;
			}
			if(t>1){
				maxSurprise = ((t-2)/3) + 2;
				if(maxSurprise>10){
					maxSurprise = 10;
				}
			}
			if(maxNormal>=p){
				ans++;
			} else if(S>0&&maxSurprise>=p){
				S--;
				ans++;
			}
		}
		return ans+"";
	}
		
}
