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

public class Dancing {

	/**
	 * 
	 * @param N
	 *            Number of Googlers
	 * @param S
	 *            number of surprising triplets of scores
	 * @param P
	 * 
	 * @param Ti
	 *            the total points of the Googlers
	 * 
	 * @return what is the maximum number of Googlers that could have had a best
	 *         result of at least p
	 */
	public static int howMany(int N, int S, int P, int[] Ti) {

		if (0 == P)
			return N;

		int count = 0;
		int specials = 0;

		for (int t : Ti) {

			if (0 == t)
				continue;
			
			int mod = t % 3;
			int div = t / 3;

			int max = -1;
			int maxSpecial = -1;

			switch (mod) {

			case 0:
				max = div;
				maxSpecial = div + 1;
				break;

			case 1:
				max = div + 1; // same as 'maxSpecial'
				break;

			case 2:
				max = div + 1;
				maxSpecial = div + 2;
				break;
			}

			if (max >= P)
				count++;

			else if (maxSpecial >= P)
				specials++;
		}

		if (specials > S)
			count += S;

		else
			count += specials;

		return count;
	}
}
