/**
 * 
 */
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();

	}

}

public class Googler {
	int total;
	boolean prizeSurprise = false;
	boolean prizeNoSurprise = false;
	boolean failSurprise = false;
	boolean failNoSurprise = false;
	boolean used = false;
	int trueCounter = 0;

	public Googler poss(int total, int prize){
		this.used = false;
		this.total = total;
		for (int i=10; i>-1; i--){
			if (total>=i){
				int twoA = total - (2*i);
				if (twoA >=0 && twoA<= i){
					if (twoA == i || twoA == i-1){
						if (i>=prize){
							if (prizeNoSurprise == false){trueCounter++;}
							prizeNoSurprise = true;
						} else {
							if (failNoSurprise == false){trueCounter++;}
							failNoSurprise = true;
						}
					}
					if (twoA == i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
				int oneA = total - i - (i-1);
				if (oneA >=0 && oneA<= i){
					if (oneA == i ||oneA == i-1){
						if (i>=prize){
							if (prizeNoSurprise == false){trueCounter++;}
							prizeNoSurprise = true;
						} else {
							if (failNoSurprise == false){trueCounter++;}
							failNoSurprise = true;
						}
					}
					if (oneA == i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
				int splitA = total - i - (i-2);
				if (splitA >=0 && oneA<= i){
					if (splitA == i ||oneA == i-1 || splitA== i-2){
						if (i>=prize){
							if (prizeSurprise == false){trueCounter++;}
							prizeSurprise = true;
						} else {
							if (failSurprise == false){trueCounter++;}
							failSurprise = true;
						}
					}
				}
			}
		}
		return this;
	}
	
}
