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 org.marcus905.gcj2012;

import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

public class DancingWithTheGooglers {

	public static void main(String[] args){
		try {
			
			BufferedInputStream	bis = new BufferedInputStream(new FileInputStream(new File("/home/marcus905/Desktop/in")));
			
			Scanner sc = new Scanner(bis);
			PrintWriter pw = new PrintWriter(new BufferedOutputStream(new FileOutputStream(new File("/home/marcus905/Desktop/out"))));
			int len = Integer.parseInt(sc.next().trim());
			sc.nextLine();
			int[] results = new int[len];
						
			for(int i = 0; i < len; i++){
				
				int googlers = 0, surprisingscoresets = 0, thresholdgrade = 0, currentgoogler = 0;
				int[] scores = new int[3];
				googlers = sc.nextInt();
				surprisingscoresets = sc.nextInt();
				thresholdgrade = sc.nextInt();
				
				for(int j = 0; j < googlers; j++){
					currentgoogler = sc.nextInt();
					if ((currentgoogler/3==thresholdgrade-2 && surprisingscoresets > 0
							&& currentgoogler % 3 == 2) ||
							(currentgoogler/3==thresholdgrade-1 && surprisingscoresets > 0
							&& currentgoogler % 3 == 0)
							&& (currentgoogler > 1 && currentgoogler < 29)){
						surprisingscoresets--;
						/*
						int averagegrade = currentgoogler/3;
						for(int k = 0; k<3; k++)
							scores[k]=averagegrade;
						currentgoogler-=3*averagegrade;
						switch(currentgoogler){
						case 2:scores[0]+=2; currentgoogler=0; break;
						case 1:scores[1]+=1; currentgoogler=0;
						case 0:scores[2]+=1; scores[0]-=1; currentgoogler=0;
						}
						*/
						results[i]++;
					}
					else if (currentgoogler/3==thresholdgrade-1 && currentgoogler % 3 > 0
							|| currentgoogler/3>=thresholdgrade){
						results[i]++;
					}
					
				}
				
				
				
				
				
			}
			
			int k = 1;
			for(int j: results){
				pw.print("Case #"+k+": "+j+"\n");
				k++;
			}
			pw.close();
			
		}
		catch(Exception e){
			e.printStackTrace();
		}
	}

}
