package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

package googlers;

import java.io.File;

import io.Reader;

public class DanceParty {
	public static void main(String[] args){
		new DanceParty();
	}
	
	
	
	public DanceParty(){
		String[] lines = Reader.getInput(new File("B-large.in"));
		//String[] lines = Reader.getInput(new File("danceInput.in"));
		
		
		for (int i = 0; i < lines.length; i++){
			String line = lines[i];
			String[] peicesString = line.split(" ");
			int[] peices = new int[peicesString.length];
			for(int j = 0; j<peices.length; j++){
				peices[j] = Integer.parseInt(peicesString[j]);
			}
			
			int numGooglers = peices[0];
			int numSurprises = peices[1];
			int minBestResult = peices[2];
			int numPossible = 0;
			int numPossibleSurprises = 0;
			
			int N = 3*minBestResult-2;
			
			for (int j = 3; j < peices.length; j++){
				int sc = peices[j];
				if (sc>=N){
					numPossible++;
				}
				else if (numPossibleSurprises<numSurprises && sc>=N-2 && sc>=minBestResult){
					numPossibleSurprises++;
				}
			}
			
			numPossible+=numPossibleSurprises;
			if (numPossible>numGooglers)numPossible=numGooglers;
			if (numPossible<0)numPossible=0;
			
			System.out.println("Case #"+(i+1)+": "+numPossible);
		}
		
		
	}
}
