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

/**
 * Convenience class for declaring a method inside a method, so as to avoid code duplication without having to declare a new method
 * in the class. This also keeps functions closer to where they are applied. It's butt-ugly but it's about the best you can do in
 * Java.
 * 
 * <code>
			final HashSet<String> allNames = new HashSet<String>();
			Lambda<Set<String>, Void> addAllIfNotNull = new Lambda<Set<String>, Void>() {
				public Void apply(Set<String> newNames) {
					if (allNames != null)
						allNames.addAll(newNames);
					return null;
				}
			};
			allNames.add(cell.getName());
			addAllIfNotNull.apply(cell.getValues("Main_name"));
			addAllIfNotNull.apply(cell.getValues("Other_name"));
			addAllIfNotNull.apply(cell.getValues("Tree_node"));
			addAllIfNotNull.apply(cell.getValues("Lineage_name"));
 * </code>
 */

public interface Lambda<P, V> {
	public V apply(P param);
}
