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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;

/**
 *
 * @author Saul Hidalgo
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            Scanner sc = new Scanner(new File("test.txt"));
            PrintStream ps = new PrintStream(new File("output.txt"));

            int T = sc.nextInt();
            for ( int t = 1 ; t <= T ; t++ ){
                int n = sc.nextInt(), s = sc.nextInt(), p = sc.nextInt();

                int[] l = new int[n];
                for ( int i = 0 ; i < n ; i++ ){
                    l[i] = sc.nextInt() - p ;
                }

                int a = 0 , b = 0;

                for ( int i = 0 ; i < n ; i++ ){
                    if ( l[i] == -1 && p > 0 ){
                    }else if ( l[i] >= 2*( p - 1 ) ){
                        ++a;
                    }else if ( l[i] >= 2*( p - 2 ) ){
                        ++b;
                    }
                }
                ps.println("Case #" + t + ": " + ( a + b - Math.max(0, b - s ) ));
            }
            
        }
        catch (FileNotFoundException ex) {
            // =(
        }
    }
}
