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

public class GoogleCount{
	
	public GoogleCount(String line, int i, BufferedWriter out){
		int count=0;
		try {
//			ArrayList<Goods> gooda = new ArrayList();
//			TreeSet<Integer> goods = new TreeSet();
			StringTokenizer token = new StringTokenizer(line);
			out.write("Case #"+Integer.toString(i)+": ");
			String str = null;
			Goods cur;
			int countS=0, countG=0;
	  		while (token.hasMoreTokens()){
				str = token.nextToken();
				int totG=Integer.parseInt(str);

				str = token.nextToken();
				int totS=Integer.parseInt(str);

				str = token.nextToken();
				int best=Integer.parseInt(str);

				int curr,temp;
				while (token.hasMoreTokens() && count<totG){
					str = token.nextToken();
					curr=Integer.parseInt(str);
					
					if(curr>=best){
						if (curr-best>=((best-1)*2)){

							countG++;
						}
						else if(curr-best>=((best-2)*2) && countS<totS){

							countS++;
							countG++;
						}
					}
					count++;
				}
			}
			out.write(Integer.toString(countG));
			System.out.print("\n");
			out.write("\n");
		}
		catch (IOException ex){
		      ex.printStackTrace();	    		
		}	
	}		
}
