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);
	}
  }
}
package WQ;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Problem_B {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {
		String filename = "B-small-attempt0 (1).in";
		Scanner s = new Scanner(new FileReader(filename));
		PrintWriter out = new PrintWriter("out.txt");
		int num = s.nextInt();
		for (int CASE = 1; CASE <= num; CASE++) {
			int n = s.nextInt();
			int sr = s.nextInt();
			int p = s.nextInt();
			int[] compet = new int[n];
			for (int i = 0; i < n; i++) {
				compet[i] = s.nextInt();
			}
			int count = 0;
			for (int i = 0; i < compet.length; i++) {
				int divide = compet[i] / 3;
				int rem = compet[i] % 3;
				if (divide >= p)
					count++;
				else {
					if (rem == 0 && sr > 0 && divide > 0 && divide + 1 >= p) {
						count++;
						sr--;
					} else if (rem == 1 && divide + 1 >= p) {
						count++;
					} else if (rem == 2) {
						if (divide + 1 >= p)
							count++;
						else if (sr > 0 && divide + 2 >= p) {
							count++;
							sr--;
						}
					}
				}
			}
			out.println("Case #" + CASE + ": " + count);
		}
		out.close();
	}
}
