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




/**
 *
 * @author Zvi Ehrman
 * @version 1 @date 14/04/2012
 *
 * Problem B. Dancing With the Googlers
 */

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

public class GoogleDancing {
    
    static int numberOfCases = 0;
    private static FileWriter outFile;
    private static String answersFile = "../answerForB.out";
    private static String questionFile = "../q.in";
    private static File aFile = new File(answersFile);
    private static int caseNum = 0;
    private static int numberOfGooglers = 0;
    private static int numberOfS = 0;
    private static int theP = 0;

    public static void main(String[] args) throws IOException {
        outFile = new FileWriter(aFile);

        loadInput(questionFile);

    }

    public static void loadInput(String fileName) throws IOException {

        Scanner input;
        try {
            input = new Scanner(new File(fileName));
            while (input.hasNext()) {

                numberOfCases = input.nextInt();
                input.nextLine();
                
                for (int i = 0; i < numberOfCases; i++) {
                    numberOfGooglers = input.nextInt();
                    numberOfS = input.nextInt();
                    theP = input.nextInt();
                    
                    ArrayList<Integer> scores = new ArrayList<Integer>();
                    
                    for (int j = 0; j < numberOfGooglers; j++) {
                        scores.add(input.nextInt());
                    }

                    findAnswer(scores);

                }

            }
            input.close();
        } catch (FileNotFoundException ex) {
            System.out.println("Oh no couldn't open the file? :(");
        }
    }

    static private void findAnswer(ArrayList<Integer> arr) throws IOException {
        
        caseNum++;
        int sum = 0;
        int usedS = 0;

        outFile.write("Case #" + caseNum + ": ");
        System.out.print("Case #" + caseNum + ": ");

        for (Integer integer : arr) {
                if(integer>=theP)
                {
                if(integer >= (theP*3)-2)
                    sum++;
                else if(usedS<numberOfS && (integer >=(theP*3)-4))
                {
                    sum++;
                    usedS++;
                }
                }
        }
        
        outFile.write("" + sum);
        System.out.print("" + sum);
            
        
        outFile.write("\n");
        System.out.println("\n");
        outFile.flush();

    }
    
   
}
