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 util.Runner;


public class DancingWithTheGooglers extends Runner{

	@Override
	public String dealWithCase(String line) {
		String[] splits = line.split(" ", -1);
		int noOfDancers = Integer.parseInt(splits[0]);
		int noOfSurprises = Integer.parseInt(splits[1]);
		int minimumScore = Integer.parseInt(splits[2]);
		int needSurpriseMinimum = minimumScore * 3 - 4;
		int noNeedForSurpriseMinimum = minimumScore * 3 - 2;
		if (minimumScore == 0) {
			needSurpriseMinimum = 0;
			noNeedForSurpriseMinimum = 0;
		} else if (minimumScore == 1) {
			needSurpriseMinimum = 1;
			noNeedForSurpriseMinimum = 1;
		}
		int needSurpriseCount = 0;
		int noNeedForSurpriseCount = 0;
		for (int i=3;i<splits.length;i++) {
			int currentTotal = Integer.parseInt(splits[i]);
			if (currentTotal >= noNeedForSurpriseMinimum) {
				noNeedForSurpriseCount++;
			} else if (currentTotal >= needSurpriseMinimum) {
				needSurpriseCount++;
			}
		}
		int result = noNeedForSurpriseCount + (noOfSurprises < needSurpriseCount ? noOfSurprises : needSurpriseCount);
		return String.valueOf(result);
	}
	
	public static void main(String[] args) throws Exception {
		DancingWithTheGooglers runner = new DancingWithTheGooglers();
		runner.run(args);
	}

}
