import java.util.Scanner;
import java.io.*;
class dance
{
  public static void main (String[] args) throws IOException
  { 
    File    inputData = new File("B-small-attempt0.in");
	File 	outputData= new File("Boutput.txt");
    Scanner scan = new Scanner( inputData );
	PrintStream print= new PrintStream(outputData);
    
	int t;
	int n,s,p,pi;
	t= scan.nextInt();
	for(int i=1;i<=t;i++)
	{
	n=scan.nextInt();	s=scan.nextInt();	p=scan.nextInt();
	int supTrip=0, notsupTrip=0;
	
	for(int j=0;j<n;j++)
	{
		pi=scan.nextInt();
		if(pi>(3*p-3))
		notsupTrip++;
		else if((pi>=(3*p-4))&&(pi<=(3*p-3))&&(pi>p))
		supTrip++;
	}
	
	if(s<=supTrip)
	notsupTrip=notsupTrip+s;
	else if(s>supTrip)
	notsupTrip= notsupTrip+supTrip;
	print.println("Case #"+i+": "+notsupTrip);
	}
  }
}
import java.util.Scanner;
import java.util.Arrays;
import java.io.File;

public class Dancing {
	public static void main (String[] args) {
		Scanner sc = null;
		try {
			sc = new Scanner(new File("input.txt"));
		} catch (Exception e) {}
		int N, S, p, result;
		int[] t;
		String out;
		int T = sc.nextInt();
		sc.nextLine();
		for (int i = 1; i <= T; i++) {
			result = 0;
			N = sc.nextInt();
			S = sc.nextInt();
			p = sc.nextInt();
			t = new int[N];
			for (int j = 0; j < N; j++) {
				t[j] = -sc.nextInt();
			}
			out = "Case #" + i + ": ";
			Arrays.sort(t);
			for (int j = 0; j < N; j++) {
				t[j] = -t[j];
				if ((t[j] == 0) && (p != 0)) {
				} else if (t[j] >= 3*p - 2) {
					result++;
				} else if ((t[j] >= 3*p - 4) && (S > 0)) {
					result++;
					S--;
				}
			}
			System.out.print(out + result + ((i < T)? "\n" : ""));
		}
	}
}