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

/**
 *
 * @author pulasthi
 */
public class QB12 {

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter("b.txt");
        int T = sc.nextInt();
        for (int i = 0; i < T; i++) {
            int result = 0;
            int N = sc.nextInt(); //no of googlers
            int S = sc.nextInt();   //surprising
            int p = sc.nextInt();   //max score
            int noSCutoff = p * 3 - 2;
            int sCutoff = p * 3 - 4;
            noSCutoff = Math.max(p, noSCutoff);
            sCutoff = Math.max(p, sCutoff);
            for (int j = 0; j < N; j++) {
                int number = sc.nextInt();
                if (number >= noSCutoff) {
                    result++;
                } else if (S > 0 && number >= sCutoff) {
                    S--;
                    result++;
                }
            }
            out.print("Case #" + (i + 1) + ": ");
            out.println(result);
        }
        out.flush();
        out.close();
    }
}
