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.ArrayList;
import java.util.Collections;
import java.util.Scanner;


public class b {
	public static void main(String[] args){
		new b().go();
	}

	private void go() {
		Scanner in=new Scanner(System.in);
		int numc=in.nextInt();
		for(int cnum=1;cnum<=numc;cnum++){
			int n=in.nextInt(),s=in.nextInt(),p=in.nextInt();
			ArrayList<Integer>a=new ArrayList<Integer>();
			for(int i=0;i<n;i++)a.add(in.nextInt());
			Collections.sort(a,Collections.reverseOrder());
			int count=0;
			for(int i:a){
				if((i+2)/3>=p&&i>=p)count++;
				else if(s>0&&(i+4)/3>=p&&i>=p){
					count++;
					s--;
				}
			}
			System.out.printf("Case #%d: %d\n", cnum,count);
		}
	}

}