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 Test {
	public static void main(String[] args) {
		int cases, num, sur, p;
		int[] googlers;
		Scanner sin = new Scanner(System.in);
		int[] ans;

		cases = sin.nextInt();
		ans = new int[cases];
		for (int i = 0; i < cases; i++) {
			int count = 0;
			int couSur = 0;
			int center, notSurLeast, least;

			num = sin.nextInt();
			googlers = new int[num];
			sur = sin.nextInt();
			p = sin.nextInt();
			for (int j = 0; j < num; j++)
				googlers[j] = sin.nextInt();

			center = 3 * p;
			notSurLeast = center - 2;
			least = center - 4;
			if (least < p)
				least = p;
			for (int j = 0; j < num; j++)
				if (googlers[j] >= least) {
					count++;
					if (googlers[j] < notSurLeast)
						couSur++;
				}
			
			if (couSur > sur)
				count -= (couSur - sur);
			ans[i] = count;
		}

		for (int i = 0; i < cases; i++)
			System.out.println("Case #" + (i + 1) + ": " + ans[i]);
	}
}