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 twentytwelve.qualification.b;

import java.util.Scanner;

public final class DancingWithTheGooglers {

    /**
     * @param args
     */
    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int cases = sc.nextInt();
	for (int no = 1; no <= cases; no++) {
	    System.out.print("Case #" + no + ": ");
	    // googlers
	    int N = sc.nextInt();
	    // surprises
	    int S = sc.nextInt();
	    // best result
	    int p = sc.nextInt();

	    // unnecessary calculations
	    int p2 = 3 * p - 2;
	    int p4 = p2 - 2;

	    int max = 0;
	    for (int triplet = 0; triplet < N; triplet++) {
		int score = sc.nextInt();
		if (score >= p) {
		    if (score >= p2) {
			max++;
		    } else if (score < p2 && score >= p4 && S > 0) {
			max++;
			S--;
		    }
		}
	    }
	    System.out.println(max);
	}
    }
}
