package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

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

}
