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 Dance
{

    public static void main(String args[]) throws Exception
    {
        int N,S,T,p,ti;
        
        Scanner in = new Scanner( System.in );
        T = in.nextInt();
        int pos = 1;
        while( pos <= T )
        {
        
            N = in.nextInt(); // Number of idiots
            S = in.nextInt(); // Number of times a judge was biased
            p = in.nextInt(); // The best result we are looking for

            int count = 0;
            
            int test_1 = Math.max(p * 3 - 2 , p );
            int test_2 = Math.max( test_1 - 2 , p);
            
            for( int i = 0 ; i < N ;i++)
            {
                ti = in.nextInt();

                if( ti >= test_1 )
                {
                    count++;
                }else if( S > 0 && ti >= test_2 )
                {
                    S--;
                    count++;
                }
            }
            
            System.out.println("Case #" + pos + ": " + count);
            
            pos++;
        }
    }
}