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 _2012._0.b_dancers;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.LineNumberReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;


public class DancingWithGooglers
{
	public static int countMaxMinScores (int[] totalScores, int i, int numSurprises, int minDesiredPoints, int cabeSurprise)
	{
		if (i >= totalScores.length) {
			if (numSurprises > cabeSurprise) {
				return cabeSurprise - numSurprises;
			} else {
				return 0;
			}
		}
		
		int newCount = 0;
		
System.out.print (totalScores[i] + " (" + minDesiredPoints + "): ");
		if (((minDesiredPoints * 3) - 0) <= totalScores[i]) {
System.out.println("a");
			newCount = 1;
//			if ((((minDesiredPoints * 3) - 4) > 0) || (totalScores[i] <= 8)) {
			if ((totalScores[i] >= 2) && (totalScores[i] <= 28)) {
				cabeSurprise++;
			}
			
		} else if ((((minDesiredPoints * 3) - 2) <= totalScores[i]) && (minDesiredPoints >= 1)) {
System.out.println("b");
			newCount = 1;
			if ((totalScores[i] >= 2) && (totalScores[i] <= 28)) {
			//if ((((minDesiredPoints * 3) - 4) > 0) || (totalScores[i] <= 8)) {
				cabeSurprise++;
			}
			
		} else if ((((minDesiredPoints * 3) - 4) <= totalScores[i]) && (numSurprises > 0) && (minDesiredPoints >= 2)) {
System.out.println("c");
			newCount = 1;
			numSurprises = numSurprises - 1;
		} else {
			if (totalScores[i] >= 2)  cabeSurprise++;
System.out.println("NO");
		}
		
		return newCount + countMaxMinScores (totalScores, i+1, numSurprises, minDesiredPoints, cabeSurprise);
	}
	
	
	/**
	 * @param args
	 */
	public static void main(String[] args)
			throws Exception
	{
		long t0 = System.currentTimeMillis();
		String sIn = "src/_2012/_0/b_dancers/B-large.in";
		if (args.length > 0)  sIn = args[0];
		String sOut = sIn;
		if (sOut.endsWith (".in")) sOut = sOut.substring (0, sOut.length() - 3);
		sOut = sOut + ".out";
		
		LineNumberReader in = new LineNumberReader (new FileReader (sIn));
		PrintWriter out = new PrintWriter (new FileWriter (sOut));
	
		String linea0 = in.readLine();
		int numCasos = Integer.parseInt (linea0);
		
		for (int i=0; i<numCasos; i++) {
			System.out.println ("Case #" + (i+1));
			String s = in.readLine();
			
			String[] trozos = s.split (" ");
			int numDancers = Integer.parseInt(trozos[0]);
			int maxSurprising = Integer.parseInt(trozos[1]);
			int minDesiredPoints = Integer.parseInt(trozos[2]);
			
			int[] totalScores = new int[numDancers];
			for (int j=0; j<numDancers; j++) {
				totalScores[j] = Integer.parseInt(trozos[3 + j]);
			}
			
			int res = countMaxMinScores (totalScores, 0, maxSurprising, minDesiredPoints, 0);
			
			out.println ("Case #" + (i+1) + ": " + res);
		}
		
		
		out.close();
		
		long t1 = System.currentTimeMillis();
		long seg = ((t1 - t0) / 1000);
		double mins = seg / 60d;
		
		System.out.println ("OK - " + mins + " minutos");
	}


}
