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.FileWriter;
import java.util.HashMap;
import java.util.Scanner;
import java.util.logging.Logger;

public class B2012 {
	public static void main(String[] args) throws Exception {
		File f = new File("C:\\gcj\\b_res.txt");
		FileWriter w = new FileWriter(f);
		Scanner sca = new Scanner(new File("C:\\gcj\\b.txt"));
		int T = sca.nextInt();
		for (int i = 0; i < T; i++) {
			int N = sca.nextInt();
			int S = sca.nextInt();
			int p = sca.nextInt();
			int[] t = new int[N];
			int res = 0;
			int puwede = 0;
			for (int j = 0; j < N; j++) {
				t[j] = sca.nextInt();
				if (t[j] >= p * 3 - 2) {
					res++;
				} else if (t[j] >= p * 3 - 4 && p * 3 - 4 > 0) {
					puwede++;
				}
			}
			res += Math.min(puwede, S);
			w.write("Case #" + (i + 1) + ": " + res + "\n");
		}
		w.flush();
		w.close();
	}

}
