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

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

/**
 *
 * @author Student
 */
public class Test2 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException {
        // TODO code application logic here
        int i=1;
        Scanner ss=new Scanner(new File("B-small-attempt1.in.txt"));
        PrintWriter x=new PrintWriter(new File("B-small-attempt1.out.txt"));
        if(ss.hasNext()) ss.next();
        while(ss.hasNextLine()&&i<=100){
            int n = 0;
            if(ss.hasNext()) n=Integer.parseInt(ss.next());
            int s = 0;
            if(ss.hasNext()) s=Integer.parseInt(ss.next());
            int p = 0;
            if(ss.hasNext()) p=Integer.parseInt(ss.next());
            LinkedList<Integer> l=new LinkedList<>();
            for(int index=0;index<n;index++) l.add(Integer.parseInt(ss.next()));
            x.println("Case #"+i+": "+Best.opt(n,s,p, l));
            i++;
        }
        x.close();
        }
    }
