import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
package googlers;

import java.io.File;

import io.Reader;

public class DanceParty {
	public static void main(String[] args){
		new DanceParty();
	}
	
	
	
	public DanceParty(){
		String[] lines = Reader.getInput(new File("B-small-attempt1.in"));
		//String[] lines = Reader.getInput(new File("danceInput.in"));
		
		
		for (int i = 0; i < lines.length; i++){
			String line = lines[i];
			String[] peicesString = line.split(" ");
			int[] peices = new int[peicesString.length];
			for(int j = 0; j<peices.length; j++){
				peices[j] = Integer.parseInt(peicesString[j]);
			}
			
			int numGooglers = peices[0];
			int numSurprises = peices[1];
			int minBestResult = peices[2];
			int numPossible = 0;
			int numPossibleSurprises = 0;
			
			int N = 3*minBestResult-2;
			
			for (int j = 3; j < peices.length; j++){
				int sc = peices[j];
				if (sc>=N){
					numPossible++;
				}
				else if (numPossibleSurprises<numSurprises && sc>=N-2 && sc>=minBestResult){
					numPossibleSurprises++;
				}
			}
			
			numPossible+=numPossibleSurprises;
			if (numPossible>numGooglers)numPossible=numGooglers;
			if (numPossible<0)numPossible=0;
			
			System.out.println("Case #"+(i+1)+": "+numPossible);
		}
		
		
	}
}
