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);
	}
  }
}
public class DancingWiththeGooglers {
	
	public static void main(String[] args) {
		//initialize();
		java.util.Scanner sc = new java.util.Scanner(System.in);
		int testCases = sc.nextInt();
		sc.nextLine();
		for(int i=0;i<testCases;i++){
			int s,p,n,upperBound,lowerBound;
			
			//int[][] triplet;
			int[] sum;
			//boolean[] processed;
			int count = 0;
			
			n = sc.nextInt();
			s = sc.nextInt();
			p = sc.nextInt();
			
			upperBound = 3*p;
			lowerBound = 3*p-5;
			if(lowerBound < 0)
				lowerBound = 0;
			sum = new int[n];
			//processed = new boolean[n];
			//triplet = new int[n][3];
			
			for(int i1=0;i1<n;i1++){
				sum[i1] = sc.nextInt();
				if(sum[i1] >= upperBound-2){ 
					count++;
					//processed[i1] = true;
				}
				else if(sum[i1] > lowerBound){
					//processed[i1] = true;
					if(s > 0){
						s--;
						count++;
					}		
				}
			}
			
			StringBuffer sb = new StringBuffer("Case #");
			sb.append(i+1);
			sb.append(": ");
			
			sb.append(count);
			System.out.println(sb);
		}
	}
	
}