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

import java.util.Arrays;

import template.Template;

public class DancingWithTheGooglers extends Template {
	public static void main(String[] args) throws Exception {

		init("src/dancingwiththegooglers/B-small-attempt3");
		int lines = readInt();
		for (int i = 1; i <= lines; i++) {
			int[] line = readIntArray();
			int n = line[0];
			int s = line[1];
			int p = line[2];
			int[] t = new int[n];
			int result = 0;
			for (int j = 0; j < n; j++) {
				t[j] = line[j + 3];
				int m = t[j] / 3;
				int r = t[j] % 3 > 0 ? 1 : 0;
				if (m >= p)
					result++;
				else if (m + r >= p
						&& (m - r >= 0 || m + r > 0 && t[j] % 3 == 2))
					result++;
				else if (m + r + 1 >= p && s > 0 && m - r - 1 >= 0
						&& t[j] % 3 != 1) {
					result++;
					s--;
				}

			}

			System.out.println("\n" + Arrays.toString(line));
			write("Case #" + i + ": " + result);
		}
	}
}
