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

}

import java.util.ArrayList;
import java.util.Scanner;


public class GooglerDancer {

	private int caseNumber;
	private int numberOfGooglers;
	private int numberOfSuprisingTriplets;
	private int minimumBestScoreP;
	private ArrayList<Integer> list;


	public GooglerDancer(int caseNumber,String data) {

		this.caseNumber=caseNumber;
		Scanner s=new Scanner(data);
		this.numberOfGooglers=s.nextInt();
		this.numberOfSuprisingTriplets=s.nextInt();
		this.minimumBestScoreP=s.nextInt();
		list=new ArrayList<Integer>();
		while(s.hasNextInt()){
			list.add(s.nextInt());
		}
	}


	public void process() {
		int count =0;
		
		if(numberOfGooglers>0){
		/////
			if(minimumBestScoreP>0){
		for(int i=0;i<numberOfGooglers;i++){
			if(list.get(i)>0)
			{
			if((Integer)(list.get(i)/minimumBestScoreP)>=3){
				count++;
			}
			else{
				if((Integer)(minimumBestScoreP-(list.get(i)-minimumBestScoreP)/2)==1){
					count++;
				}
				else{
					if((Integer)(minimumBestScoreP-(list.get(i)-minimumBestScoreP)/2)==2 && numberOfSuprisingTriplets>0){
						count++;
						numberOfSuprisingTriplets--;
					}
				}
			}
		}
		}
		////////////
			}else{
				count=numberOfGooglers;
			}
		}
		System.out.println("Case #"+caseNumber+": "+count);

	}

}
