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.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintStream;


public class Solver {
	
	protected final static String IN_FILE = "in";
	protected final static String OUT_FILE = "out";
	protected final static String OUT_PREFIX = "Case #$: ";
	protected BufferedReader in;
	protected int cases;
	
	
	public Solver() throws Throwable {
		File inFile = new File(IN_FILE);
		if (!inFile.exists()) {
			throw new RuntimeException();
		}
		in = new BufferedReader(new FileReader(inFile));
		cases = Integer.parseInt(in.readLine());
		
		
		File outFile = new File(OUT_FILE);
		if (outFile.exists()) {
			outFile.delete();
		}
		outFile.createNewFile();
		System.setOut(new PrintStream(outFile) );

		for (int i = 0; i < cases; i++) {
			ProblemCase c = new DancingGooglersProblemCase(in);
			System.out.println(OUT_PREFIX.replaceAll("[$]", (new Integer(i+1)).toString()) + c.getResult());
		}
	}
	
	public static void main(String[] args) throws Throwable {
		new Solver();
	}
}
