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.List;


public class Dancers implements Solver {
	int N;
	int S;
	int p;
	List<Integer> dan = new ArrayList<Integer>();
	

	public Dancers(List<String> lineas) {
		String[] cosa = lineas.get(0).split(" ");
		N=Integer.parseInt(cosa[0]);
		S=Integer.parseInt(cosa[1]);
		p=Integer.parseInt(cosa[2]);
		for (int i=0; i<N; i++){
			dan.add(Integer.parseInt(cosa[i+3]));
		}
		// TODO Auto-generated constructor stub
	}


	@Override
	public String solve() {
		int conta=0;
		for (int i=0; i<N; i++){
			if (dan.get(i)>=p+p-1+p-1 && dan.get(i)>=p){
				conta++;
			}
			else if(dan.get(i)>=p+p-2+p-2 && dan.get(i)>=p && S>0){
				conta++;
				S--;
			}
		}
		// TODO Auto-generated method stub
		return conta+"";
	}

}
