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

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

import reusable.CodeJamBase;

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		new CodeJamBase("B-small-attempt0") {

			@Override
			protected String solution() {
				int[] input = nextIntArray();

				int googlers = input[0];
				int suprisingTriplets = input[1];
				int minBestResult = input[2];

				int minTotal = Math.max(0, 3 * minBestResult - 2); // (a-1)+(a-1)+a
				int minTotalSuprising = Math.max(2, 3 * minBestResult - 4); // (a-2)+(a-2)+a

				int result = 0;

				List<Integer> googlerScores = new ArrayList<>();
				for (int i = 3; i < googlers + 3; i++) {
					googlerScores.add(input[i]);
				}
				Collections.sort(googlerScores, Collections.reverseOrder());

				for (int googlerScore : googlerScores) {
					if (googlerScore >= minTotal) {
						result++;
					} else if ((suprisingTriplets > 0) && (googlerScore >= minTotalSuprising)) {
						suprisingTriplets--;
						result++;
					} else {
						break;
					}
				}

				return String.valueOf(result);
			}

		}.run();
	}
}
