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.gcj.main;

import java.util.ArrayList;

import com.gcj.parser.Parser;
import com.gcj.parser.MaxPoints;

public class Main {


	public static void main(String[] args) {
		Parser parser = new Parser("resource/InputData.txt");
		ArrayList<Integer>[] datas = parser.toArray();
		int index = 1;

		for (ArrayList<Integer> dataRow : datas){
			
			int nbGooglers = dataRow.get(0).intValue();
			int nbSurprinsingResult = dataRow.get(1).intValue();
			int targetPoints = dataRow.get(2).intValue();
			
			int result = 0;
			
			for (int i = 0 ; i < nbGooglers ; i++) {
				if (MaxPoints.normal(dataRow.get(i+3)) >= targetPoints){
					result ++;
				}
				else {
					if (nbSurprinsingResult > 0){
						if (MaxPoints.surprising(dataRow.get(i+3)) >= targetPoints){
							result ++;
							nbSurprinsingResult --;
						}
					}
				}
			}
			
			StringBuffer stringBuf = new StringBuffer("Case #").append(index).append(": ").append(result);
			System.out.println(stringBuf.toString());
			index ++;
		}
	}
}