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.HashMap;
import java.util.List;
import java.util.Map;


public class ProblemOne {

	public static void main(String[] args) throws Exception{
		Reader reader = new Reader("A-small-attempt0.in");
		Writer writer = new Writer("output.txt");
		reader.open();
		writer.open();
		String line;
		
		while((line = reader.getNext())!=null){
			String[] parts = line.split(" ");
			int n = Integer.parseInt(parts[0]);
			int s = Integer.parseInt(parts[1]);
			int p = Integer.parseInt(parts[2]);
			
			int max = 0;
			
			for(int i = 0; i < n; i++){
				int ges = Integer.parseInt(parts[3 + i]);
				int avg = ges / 3;
				int mod = ges % 3;
				if(avg >= p){
					max++;
					continue;
				}
				if(avg == p - 1 && mod > 0){
					max++;
					continue;
				}
				if(mod == 1){
					continue;
				}
				if(avg == p - 2 && mod == 2 && s > 0 && ges >= 2){
					max++;
					s--;
					continue;
				}
				if(avg == p - 1 && mod == 0 && s > 0 && ges >= 2){
					max++;
					s--;
					continue;
				}
			}
			writer.write("" + max);
		}
		reader.close();
		writer.close();
	}
}
