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

import codejam.fileHandler;

public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		fileHandler file = new fileHandler("DancingWiththeGooglers.in",
				"DancingWiththeGooglersout.in");
		int noOfCases = file.readCase();
		for (int i = 1; i <= noOfCases; i++) {
			int numberArray[] = file.readIntegers();
			int N = numberArray[0];
			int s = numberArray[1];
			int p = numberArray[2];
			int upperLimit = 3 * p - 2;
			int lowerLimit = 3 * p - 4;
			if(p==0){
				upperLimit = lowerLimit = 0;
			}
			if(p == 1){
				upperLimit = lowerLimit = 1;
			}
			int count = 0;
			for (int j = 3; j < numberArray.length; j++) {
				if (s == 0) {
					if (numberArray[j] >= upperLimit) {
						count++;
					}
				}
				else{
					if(numberArray[j] >= lowerLimit){
						if(numberArray[j] == lowerLimit){
							s--;
						}
						else if(numberArray[j] == (lowerLimit + 1)){
							s--;
						}
						count++;
					}
				}
			}
			String print = "Case #" + i + ": " + count + "\n";
			file.writeToOutput(print);
		}
	}

}
