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 com.google.code;

import java.io.IOException;

public class B extends GCJ {

	protected B() throws IOException {
		super();
	}

	@Override
	protected void code(int count) throws IOException {
		readLine();
		int N = getIntInput(0);
		int S = getIntInput(1);
		int p = getIntInput(2);
		
		int limitForOrdinary = p + (p - 1 < 0 ? p : p - 1) * 2;
		int result = 0;
		for (int i = 0; i < N; i++) {
			int googler = getIntInput(3 + i);
			if (googler>= limitForOrdinary) {
				result ++;
				continue;
			}
			if (S>0)
				if (googler>1 && googler+2 >=limitForOrdinary) {
					S--;
					result++;
					continue;
				}			
		}
		writeln(result);
	}
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		new B().run();
}
}
