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;
	}

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package google.code.jam.dancing.with.the.googlers;

import java.util.ArrayList;

/**
 *
 * @author Lucas
 */
public class BestResultFinder {

    public ArrayList<Integer> findBestResult(ArrayList<ArrayList> list) {

        ArrayList<Integer> result = new ArrayList<Integer>();
        ArrayList<Integer> current;
        int total;
        int surprising;
        int min;
        int value;

        for (int n = 0; n < list.size(); n++) {

            current = list.get(n);
            total = 0;
            surprising = current.get(1);
            min = current.get(2);

            for (int m = 0; m < current.get(0); m++) {

                value = current.get(3 + m) / 3;

                switch (current.get(3 + m) % 3) {

                    // (n, n, n) -> Regular
                    // (n - 1, n , n + 1) -> Surprising

                    case 0: {

                        if (value >= min) {
                            total++;
                        } else if ((surprising > 0) && (value > 0) && (value + 1 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                        
                    // (n, n, n + 1) -> Regular
                    // (n - 1, n + 1, n + 1) -> Surprising
                            
                    case 1: {
                        if ((value >= min) || (value + 1 >= min)) {
                            total++;
                        } else if ((surprising > 0) && (value + 1 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                        
                    // (n, n + 1, n + 1) -> Regular
                    // (n, n, n + 2) -> Surprising
                        
                    case 2: {
                        if ((value >= min) || (value + 1 >= min)) {
                            total++;
                        } else if ((surprising > 0) && (value + 2 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                }
            }
            result.add(total);
        }
        return result;
    }
}
