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 jam2012.dancers;

import java.io.File;
import java.io.IOException;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

import commons.FileUtilities;

public class GoogleDancers {

    public static void main(String[] args) throws IOException {

        List<String> strings = FileUtilities.readFile(new File(
                "B-small-attempt1.in"));

        int number = Integer.parseInt(strings.get(0));

        List<String> result = new LinkedList<String>();

        for (int i = 1; i <= number; i++) {

            Scanner s = new Scanner(strings.get(i));

            int dancers = s.nextInt();
            int surprisingAmount = s.nextInt();
            int atLeast = s.nextInt();

            int[] values = new int[dancers];
            for (int j = 0; j < dancers; j++) {
                values[j] = s.nextInt();
            }
            int[] minvalues = new int[dancers];
            boolean[] cansurprise = new boolean[dancers];
            int tresult = 0;

            // Unsurprising values
            for (int j = 0; j < dancers; j++) {
                int minAmount = values[j] / 3;
                int rest = values[j] - (minAmount * 3);
                if (rest > 0) {
                    minAmount++;
                }
                if (rest != 1 && values[j] > 1 && values[j] < 28) {
                    cansurprise[j] = true;
                }
                minvalues[j] = minAmount;
                if (minAmount >= atLeast) {
                    tresult++;
                }
            }
            for (int j = 0; j < dancers; j++) {
                if (surprisingAmount > 0 && atLeast == minvalues[j] + 1 && cansurprise[j]) {

                    surprisingAmount--;
                    tresult++;
                }
            }
            result.add(Integer.toString(tresult));
        }
        FileUtilities.writeFile(result, new File("B-small-attempt1.out"));
    }
}
