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

public class DancingWithTheGooglers {

	public static void main(String[] args) throws IOException {
		File input = new File("files/B-small-attempt0.in.txt");
		File output = new File("files/B-small-attempt0.out.txt");
		PrintWriter pw = new PrintWriter(output);
		Scanner sc = new Scanner(input);
		int T = sc.nextInt();
		for (int i = 0; i < T; i++) {
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int[] t = new int[N];
			for (int j = 0; j < t.length; j++) {
				t[j] = sc.nextInt();
			}
			int answer = solve(N, S, p, t);
			pw.println(String.format("Case #%d: %d", i + 1, answer));
		}
		pw.close();
		sc.close();
	}

	static int solve(int n, int s, int p, int[] t) {
		if (p == 0) {
			return t.length;
		}
		
		int count = 0;
		for (int i = 0; i < t.length; i++) {
			if (t[i] >= (3 * p) - 2) {
				count++;
			} else if (s > 0 && t[i] > 0 && t[i] >= (3 * p) - 4) {
				count++;
				s--;
			}
		}
		return count;
	}
}
