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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class GoogleDance {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			String userDir = System.getProperty("user.dir"); //get working directory
			userDir.replaceAll("['\']", "\\"); // replace all chars '\' with '\\' in the string
			File file = new File(System.getProperty("user.dir") + "\\QualificationRound\\GoogleDance\\in-out\\B-large.in");
	        Scanner fileScanner = new Scanner(file);
	        //delimiter is how input text is set up in this case it's the new line char
	        fileScanner.useDelimiter(System.getProperty("line.separator")); 
	        //declared for file writing
	        BufferedWriter outFile = new BufferedWriter(new FileWriter(System.getProperty("user.dir") + "\\QualificationRound\\GoogleDance\\in-out\\B-large.out"));
			int counter, inCounter, deepCounter, masterCounter, numCases, startIndex, numPpl, suprisingScores, minScore, currentNum, maxH, result;
			int judgeHigh, judgeLow;
			ArrayList<Integer> intList = new ArrayList<Integer>();
			int [] judgeScores = new int[3];
			String inputText;
			boolean suprisingScoresReal;
			numCases = Integer.parseInt(fileScanner.nextLine());
			for(masterCounter = 1; masterCounter <= numCases; masterCounter++){
				inputText = fileScanner.nextLine();
				startIndex = 0;
				result = 0;
				for( counter = 0; counter < inputText.length(); counter ++){
					if (inputText.charAt(counter) == ' ') 
					{
						intList.add(Integer.parseInt(inputText.substring(startIndex, counter))); 
						startIndex = counter + 1;
					}    			
				}
				intList.add(Integer.parseInt(inputText.substring(startIndex, counter))); 
				numPpl = intList.get(0);
				suprisingScores = intList.get(1);
				minScore = intList.get(2);
				intList.remove(0);
				intList.remove(0);
				intList.remove(0);
				if(suprisingScores == 0)
					suprisingScoresReal = false;
				else
					suprisingScoresReal = true;
				for(counter = 0; counter < intList.size(); counter++){
					if(intList.get(counter) <= 2){
						for(inCounter = 0; inCounter < intList.get(counter); inCounter++)
							judgeScores[inCounter] = 1;
						for(deepCounter = inCounter; deepCounter < 3; deepCounter++)
							judgeScores[deepCounter] = 0;
						maxH = 0;
					}
					else{
						currentNum = intList.get(counter) / 3;
						judgeScores[0] = currentNum;
						judgeScores[1] = currentNum;
						judgeScores[2] = currentNum;
						maxH = intList.get(counter) - (currentNum + currentNum + currentNum);
					}
					deepCounter = 0;
					if(maxH > 0)
						for(inCounter = 0; inCounter < maxH; inCounter++){//distribute extra points (from /3)
							judgeScores[deepCounter] = judgeScores[deepCounter] + 1;
							deepCounter++;
							if(deepCounter >= 3)
								deepCounter = 0;
						}
					Arrays.sort(judgeScores); //sorted from low (position[0]) to high (position[2])
					
					if(judgeScores[2] >= minScore)
						result++;
					else if(suprisingScoresReal == true && judgeScores[2] != 0){
						if(judgeScores[2] == judgeScores[1] && suprisingScores != 0 && judgeScores[2] + 1 >= minScore){
						result++;
						suprisingScores--;
						}
					}
				}
				//System.out.println("suprisingScores :" + suprisingScores);
				//outFile.write("suprisingScores :" + suprisingScores + "\n");
			System.out.println("Case #" + masterCounter + ": " + result);
        	outFile.write("Case #" + masterCounter + ": " + result + "\n");
        	intList.clear();
			}
			
	        fileScanner.close();
	        outFile.close();
		}
		catch (FileNotFoundException e) {
			System.out.println("File not found"); e.printStackTrace();
		}
		catch (IOException e) {
			System.out.println("IOException");
		}
	}

}
