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 com.qvark.codejam.dancinggooglers;

import java.util.Scanner;

public class DancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		for (int i = 1; i <= t; i++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int r = 0;
			for (int j = 0; j < n; j++) {
				int total = in.nextInt();
				int score = total / 3;
				int mod = total % 3;
				if (total == 0) {
					if (p == 0)
						r++;
				} else if (score >= p || (score+1>=p && mod>=1)) {
					r++;
				} else if (score + 1 >= p && mod < 1 && s > 0) {
					r++;
					s--;
				} else if (score + 2 >= p && mod == 2 && s > 0) {
					r++;
					s--;
				}
			}
			System.out.format("Case #%d: %d\n", i, r);
		}
		
		
	}

}
