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;

public class problemB {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner cin = new Scanner(System.in);
		int t = cin.nextInt();
		int k = 0, n, s, p, i, ans;
		int[] a;
		while (t > 0) {
			t--;
			k++;
			n = cin.nextInt();
			s = cin.nextInt();
			p = cin.nextInt();
			a = new int[n];
			for (i = 0; i < n; i++)
				a[i] = cin.nextInt();
			ans = 0;
			for (i = 0; i < n; i++) {				
				if(a[i]>=p+Math.max(p-1, 0)*2){
					ans++;
				}else
					if(a[i]>=p+Math.max(p-2, 0)*2 && s>0){
						ans++;
						s--;
					}
			}
			System.out.println("Case #"+k+": "+ans);
		}
	}

}
