import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

package com.googlecode.codejam.contest.gcj2012.round_q;

import java.util.Arrays;
import java.util.Iterator;
import java.util.concurrent.Callable;

import com.googlecode.codejam.model.JamCaseResolver;
import com.googlecode.codejam.model.JamCaseResolverFactory;
import com.googlecode.codejam.model.JamResolver;

public class B extends JamCaseResolver {

	private final int s; // surprising
	private final int p; // score limit
	
	private final int[] scores;
	
	public B(final int caseNumber, final Iterator<String> lineIterator) {
		super(caseNumber);
		int[] input = this.parseInt(lineIterator.next().split(" "));
		s = input[1];
		p = input[2];
		scores = Arrays.copyOfRange(input, 3, input.length);
	}
	
	@Override
	protected String resolve() {
		int surprisingUsed = s;
		int result = 0;
		for (int score : scores) {
			if(score < 2) {
				if(score >= p)
					result++;
				continue;
			}
			double avg = Math.ceil(score / 3.0);
			
			if(avg >= p) {
				result++;
			} else if (surprisingUsed > 0 && avg + 1 >= p && (score - 1) % 3 != 0) {
				result++;
				surprisingUsed--;
			}
		}
		return String.valueOf(result);
	}

	public static void main(String[] args) throws Exception {
		final JamCaseResolverFactory factory = new JamCaseResolverFactory() {
			@Override
			public Callable<String> newJamCaseResolver(int caseNumber, Iterator<String> lineIterator) {
				return new B(caseNumber, lineIterator);
			}
		};
		final JamResolver jamResolver = new JamResolver(factory, "gcj2012/round_q", "B-small-attempt0.in");
		jamResolver.resolve();
	}

}
