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 blacky.codejam.qualifications;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class DancingGoogler {

	public static void main(String args[]) throws NumberFormatException, IOException {
		File file = new File(args[0]);
		BufferedReader reader = new BufferedReader(new FileReader(file));
		int numberOfTestCases = Integer.parseInt(reader.readLine());
		for(int i = 0; i < numberOfTestCases; i++) {
			StringTokenizer tokenizer = new StringTokenizer(reader.readLine());
			int minimumerGooglers = 0;
			int usedSurprisingTriplets = 0;
			final int numberOfGooglers = Integer.parseInt(tokenizer.nextToken());
			final int surprisingTriplets = Integer.parseInt(tokenizer.nextToken());
			final int bestResultMinimum = Integer.parseInt(tokenizer.nextToken());
			int results[] = new int[numberOfGooglers];
			for(int j = 0; j < numberOfGooglers; j++) {
				results[j] = Integer.parseInt(tokenizer.nextToken()); 
			}
			for(int j = 0; j < numberOfGooglers; j++) {
				boolean possibleSurprising = false;
				boolean possibleNonSurprising = false;
				enumarate:
				for(int judge1 = 0; judge1 <= 10; judge1++) {
					for(int judge2 = judge1 - 2; judge2 <= judge1 + 2; judge2++) {
						for(int judge3 = judge1 - 2; judge3 <= judge1 + 2; judge3++) {
							if(judge1 + judge2 + judge3 == results[j]) {
								if(judge1 < 0 || judge2 < 0 || judge3 < 0) {
									continue; // Illegal case
								} else if(2 < Math.abs(judge1 - judge2) || 2 < Math.abs(judge1 - judge3)|| 2 < Math.abs(judge2 - judge3)) {
									continue; // Illegal case
								} else if (bestResultMinimum <= judge1 || bestResultMinimum <= judge2 || bestResultMinimum <= judge3) {
									if(Math.abs(judge1 - judge2) == 2 || Math.abs(judge1 - judge3) == 2 || Math.abs(judge2 - judge3) == 2) {
										possibleSurprising = true;
									} else {
										possibleNonSurprising = true;
										break enumarate;
									}
								}
							}
						}
					}
				}
				if(possibleNonSurprising) {
					minimumerGooglers++;
				} else if (possibleSurprising && usedSurprisingTriplets < surprisingTriplets) {
					minimumerGooglers++;
					usedSurprisingTriplets++;
				}
			}
			System.out.println(String.format("Case #%d: %d", i + 1, minimumerGooglers));
		}
	}
	
}
