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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class Googlers {

	static public int min(int a, int b){
		return a < b ? a : b;
	}
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		File f = new File( "B-small-attempt2.in" );
		FileWriter out=new FileWriter("output.txt");

		Scanner in = new Scanner(new FileReader(f));

		if(f.exists()){
			int T;
			int N, S, p;
			int[] t = new int[100];
			
			T = in.nextInt();
			
			for(int i = 1; i <= T; i++){
				
				N = in.nextInt();
				S = in.nextInt();
				p = in.nextInt();
				
				int sup = 0;
				int litige = 0;
				
				for(int j = 0; j < N ; j++)
					t[j] = in.nextInt();
				
				for(int j = 0; j < N ; j++){
					if(t[j] >= 3*p-2)
						sup++;
					else
						if(t[j] >= 3*p-4 && 3*p-4 >= 0)
							litige++;
					

				}
				out.write("Case #" + i +": " + (sup+ min(S, litige))+ "\n");
			
			
			}
		}

		in.close();
		out.close();

		
	}
}
