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

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
        PrintWriter out = new PrintWriter("b.out");
        StringTokenizer k;
        int t,n,s,p,count,player,reminder;
        t=Integer.parseInt(in.readLine().trim());
        for (int i = 1; i <= t; i++) {
            k=new StringTokenizer(in.readLine());
            n=Integer.parseInt(k.nextToken());
            s=Integer.parseInt(k.nextToken());
            p=Integer.parseInt(k.nextToken());
            if(p==0){
                out.append("Case #"+i+": "+n+"\n");
                continue;
            }
            count=0;
            for (int j = 0; j < n; j++) {
                player=Integer.parseInt(k.nextToken());
                if(player==0)continue;
                reminder=player%3;
                switch (reminder){
                    case 0:
                        if(player/3>=p)
                            count++;
                        else if(s>0 && (player/3)+1>=p){
                            count++;
                            s--;
                        }
                        break;
                    case 1:
                        if((player/3)+1>=p)
                            count++;
                        break;
                    case 2:
                        if((player/3)+1>=p)
                            count++;
                        else if(s>0 && (player/3)+2>=p){
                            count++;
                            s--;
                        }
                        break;
                }
            }
            out.append("Case #"+i+": "+count+"\n");
        }
        out.close();
    }
}