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

public class DancingGoogler {
	public int solve(String str){
		String[] arr = str.split(" ");
		int n = Integer.valueOf(arr[0]);
		int s = Integer.valueOf(arr[1]);
		int p = Integer.valueOf(arr[2]);
		int[] c = new int[n];
		for (int i = 0; i < c.length; i++) {
			c[i] = Integer.valueOf(arr[3+i]);
		}
		int res = 0;
		for (int i = 0; i < c.length; i++) {
			if(p == 0){
				res++;
			}else if(p == 1){
				if(c[i] > 0) res++;
			}else{
				if(c[i] >= 3*p - 2) res++;
				else if(c[i] >= 3*p - 4 && s > 0){
					res++; s--;
				}
			}
		}
		return res;
	}
}
