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 qualificationRound;

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

public class DancingWithTheGooglers {
	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(new File("D:/in.in"));
		PrintStream out = new PrintStream(new File("D:/out.txt"));
		int round = in.nextInt();
		for (int z = 1; z <= round; z++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int count = 0;
			for (int i = 0; i < n; i++) {
				int tmp = in.nextInt();
				int mod = tmp % 3;
				int avg = tmp / 3;
				if (avg >= p) {
					count++;
				} else if (mod == 2) {
					if (avg == p - 1) {
						count++;
					} else if (avg == p - 2 && s != 0) {
						count++;
						s--;
					}
				} else if (mod == 1) {
					count += (avg == p - 1)? 1: 0;
				} else if (mod == 0 && s != 0 && avg != 0) {
					if (avg == p - 1) {
						count++;
						s--;
					}					
				}
			}
			out.println("Case #" + z + ": " + count);
		}
		in.close();
		out.close();
	}
}
