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 com.lsworks.google.codejam.qualification2012;

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

import com.google.common.base.Charsets;
import com.google.common.io.Files;

public class GooglersDance {

	public static void main(String[] args) throws IOException {
		GooglersDance text2googleresse = new GooglersDance();
		text2googleresse.t2g();
	}

	private void t2g() throws IOException {
		// File inputFile = new File(
		// "src/main/resources/qualification2012/B-sample.in");
		File inputFile = new File(
				"src/main/resources/qualification2012/B-small-attempt3.in");
		// File inputFile = new File(
		// "src/main/resources/qualification2012/A-large-practice.in");
		List<String> inputs = Files.readLines(inputFile, Charsets.UTF_8);
		int totalTest = Integer.parseInt(inputs.remove(0));

		for (int test = 1; test <= totalTest; test++) {
			String[] inStr = inputs.remove(0).split(" ");
			int S = Integer.parseInt(inStr[1]);
			int p = Integer.parseInt(inStr[2]);

			int nm = 0;
			int sm = 0;
			
			if (p == 0) {
				nm = 0;
				sm = 0;
			} else if (p == 1) {
				nm = 1;
				sm = 1;
			} else if (p == 2) {
				nm = 4;
				sm = 2;
			} else {
				nm = 3 * (p - 1) + 1;
				sm = 3 * (p - 2) + 2;
			}

			int output = 0;
			for (int i = 3; i < inStr.length; i++) {
				int t = Integer.parseInt(inStr[i]);

				if (t >= nm) {
					output++;
				} else if (t >= sm && S > 0) {
					output++;
					S--;
				}
			}
			System.out.format("Case #%d: %s\n", test, output);
		}
	}
}
