/**
 * 
 */
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.Scanner;
public class Main2 {
	public static void main(String argsp[]) throws FileNotFoundException{
		
		Scanner in = new Scanner(new FileReader("input.in"));
		PrintWriter out = new PrintWriter("output.txt");
		int T = 0;
		String S1 = in.nextLine() ;
		T = Integer.parseInt(S1);
		for(int i=0;i<T;i++)
		{
			S1 = in.nextLine();
			out.print("Case #"+ (i+1) +": ");
			int space = S1.indexOf(" ");
			int N = Integer.parseInt(S1.substring(0, space));
			S1 = S1.substring(space+1);
			space = S1.indexOf(" ");
			int S = Integer.parseInt(S1.substring(0, space));
			S1 = S1.substring(space+1);
			space = S1.indexOf(" ");
			int p = Integer.parseInt(S1.substring(0, space));
			int a[] = new int[N];
			for(int j=0;j<N-1;j++)
			{
				S1 = S1.substring(space+1);
				space = S1.indexOf(" ");
				a[j] = Integer.parseInt(S1.substring(0, space));
			}
			a[N-1] = Integer.parseInt(S1.substring(space+1));
			int checker = 0;
			if (p>1)
				checker = 3*p - 4;
			else
				checker = 0;
			int great = 0;
			int surprise = 0;
			for(int k=0;k<N;k++)
			{
				if(a[k]>=checker)
					great++;
				if((a[k]==checker || a[k] == checker+1) && p>1)
					surprise++;
				if(p==1 && a[k] == 0)
					great--;
			}
//			System.out.println(great+ " " + surprise);
			int answer = 0;
			if((S-surprise)<=0)
				answer = great+S-surprise;
			else
				answer = great;
			out.println(answer);
		}
		out.close();
	}
}