import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

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-large.in");
		jamResolver.resolve();
	}

}
