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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author yondaime
 */
public class Main2 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException {

        int rest = 0;
        int division = 0;
        int count = 0;

        Scanner sc = new Scanner(new File("B-small-attempt0.in"));
        PrintWriter out = new PrintWriter(new File("B-small-attempt0.out"));
        sc.nextLine();
        int kl = 0;
        while (sc.hasNext()) {
            out.print("Case #" + (++kl) + ": ");
            count = 0;
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            for (int i = 0; i < n; i++) {
                int v = sc.nextInt();
                division = v / 3;
                rest = v % 3;

                if (p - division <= 0) {
                    count++;
                } else if (p - division == 1) {
                    if (rest != 0) {
                        count++;
                    } else if (v!=0 && s != 0) {
                        s--;
                        count++;
                    }

                } else if (p - division == 2 && rest == 2 && s != 0) {

                    s--;
                    count++;

                }
            }




            out.println(count);
        }
        out.close();
        sc.close();
    }
}
