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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.*;

public class DancingWithGooglers {

	
	public static void main(String[] args)  throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("input2.txt")));
		int inputSize = Integer.parseInt(br.readLine());
		 
		
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output2.txt")));
		for(int x = 1 ; x <= inputSize ; x++ )
		{
			
			String line = br.readLine();
			String[] lineArray = line.split(" ");
			int n = Integer.parseInt(lineArray[0]);
			int s = Integer.parseInt(lineArray[1]);
			int p = Integer.parseInt(lineArray[2]);
			int array[] = new int[n];
			for (int i = 0 ; i< n ; i++)
			{
				array[i] = Integer.parseInt(lineArray[i + 3]);
			}
			bw.write("Case #"+x+": "+findP(n,s,p,array)+"\n");
		}
	bw.flush();
	bw.close();
	br.close();
		
		
		int j[] = {15, 13, 11};
		int i = findP(3,1,5,j);
		System.out.println(i);
	}
	
	public static int findP(int numberOfGooglers, int surprisingTriplets, int p, int totalScores[])
	{
		int answer = 0;
		
		int border0 = 0; 
		int border1 = 0 ; 
		int border2 = 0;
		
		int totalScore, best;
		if (p == 0)
		{
			return numberOfGooglers;
		}
		else
		{
			for(int i = 0 ; i < numberOfGooglers ; i ++)
			{
				totalScore = totalScores[i];
				if (totalScore == 0)
				{/*do nothing*/}
				else if( totalScore % 3 == 0 )
				{
					best = totalScore / 3;
					if (best >= p)
						answer += 1;
					else if(best == (p-1) )
						border0 += 1;
				}
				else if( totalScore % 3 == 1 )
				{
					best = ( totalScore + 2) / 3;
					if (best >= p)
						answer += 1;
					else if(best == (p-1) )
						border1 += 1;
				}
				else
				{
					best = (totalScore + 1) / 3;
					if (best >= p)
						answer += 1;
					else if(best == (p-1) )
						border2 += 1;
				}
			
			}
		}
		

		if(border0 >= surprisingTriplets)
		{
			border0 -= surprisingTriplets;
			answer += surprisingTriplets;
			surprisingTriplets = 0;
		}
		else
		{
			answer += border0;
			surprisingTriplets -= border0;
			border0 = 0;
		}
		
		if(border2 >= surprisingTriplets)
		{
			border2 -= surprisingTriplets;
			answer += surprisingTriplets;
			surprisingTriplets = 0;
		}
		else
		{
			answer += border2;
			surprisingTriplets -= border2;
			border2 = 0;
		}
		
		return answer;
	}

}
