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 jam;

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

public class CodeJam2012Q2 {
	public static void main(String [] args){
		final String FILE_NAME="B-large.in";
		StringTokenizer st;
		
		//IOUsage Variables
		String lineIn="";
		int numCases=0;
		
		//Index Variables
		
		//Contest Vars
		int numGooglers = 0;
		int numSurprising = 0;
		int atLeastResult = 0;
		int[] googlerScores;
		
		int numGP = 0;
		
		try
		{
			BufferedReader br = new BufferedReader(new FileReader(FILE_NAME));
			lineIn = br.readLine();
			numCases = Integer.parseInt(lineIn);
			for(int i=0; i<numCases; i++)
			{
				lineIn = br.readLine();
				st = new StringTokenizer(lineIn);
				numGooglers = Integer.parseInt(st.nextToken());
				numSurprising = Integer.parseInt(st.nextToken());
				atLeastResult = Integer.parseInt(st.nextToken());
				googlerScores = new int[numGooglers];
				
				for(int j=0; j<numGooglers; j++)
				{
					googlerScores[j] = Integer.parseInt(st.nextToken());
				}
				
				for(int j=0; j<numGooglers; j++)
				{
					if(googlerScores[j]==0)
					{
						if(atLeastResult==0)
						{
							numGP++;
						}
					}
					else if(googlerScores[j]==1)
					{
						if(atLeastResult==0 || atLeastResult==1)
						{
							numGP++;
						}
					}
					else if(googlerScores[j]==2)
					{
						if(atLeastResult==0 || atLeastResult==1)
						{
							numGP++;
						}
						else if(atLeastResult==2)
						{
							if(numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
					}
					else
					{
						if((googlerScores[j] % 3) == 0)
						{
							if((googlerScores[j]/3) - atLeastResult > -1 )
							{
								numGP++;
							}
							else if((((googlerScores[j]/3) - atLeastResult) == -1) && numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
						else if((googlerScores[j] % 3) == 1)
						{
							if (((googlerScores[j]/3)+1) - atLeastResult >= 0)
							{
								numGP++;
							}
						}
						else if((googlerScores[j] % 3) == 2)
						{
							if((googlerScores[j]/3) - atLeastResult + 1 > -1 )
							{
								numGP++;
							}
							else if((((googlerScores[j]/3) - atLeastResult + 1) == -1) && numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
					}
				}
				System.out.println("Case #"+(i+1)+": "+numGP);
				
				numGP=0;
			}
		}
		catch(IOException ioe)
		{
			ioe.printStackTrace();
		}
		
		
	}
}
