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

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import com.google.common.collect.ArrayListMultimap;

public final class Memory {

    private static Logger log = LoggerFactory.getLogger(Memory.class);

    public ArrayListMultimap<Integer, Triplet> data = ArrayListMultimap.create();

    private static int startFor(int a) {
        return a < 2 ? 0 : a - 2;
    }

    private static int endFor(int a) {
        return a > 8 ? 10 : a + 2;
    }

    public void init() {
        log.debug("init: start");
        for (int a = 0; a <= 10; ++a) {
            int bStart = startFor(a);
            int bEnd = endFor(a);
            for (int b = bStart; b <= bEnd; ++b) {
                int cStart = startFor(b);
                int cEnd = endFor(b);
                for (int c = cStart; c <= cEnd; ++c) {
                    int total = a + b + c;
                    data.put(total, Triplet.of(a, b, c, total));
                }
            }
        }
        log.debug("init: finished");
    }
}
