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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

/**
 * http://code.google.com/codejam/contest/1460488/dashboard#s=p1
 * @author Weiwei Cheng
 */
public class DancingWithTheGooglers {

    public static void main(String[] args) throws Exception {
        
        BufferedReader br = new BufferedReader(new FileReader("_input.in"));
        BufferedWriter bw = new BufferedWriter(new FileWriter("_output.in"));
        
        br.readLine();
        
        String line = null;
        int count = 0;
        
        while((line=br.readLine())!=null){
           
            String[] input = line.split(" ");

            int numGooglers = Integer.parseInt(input[0]);
            int maxNumSuprises = Integer.parseInt(input[1]);
            int neededScore = Integer.parseInt(input[2]);
            
            int[] scores = new int[numGooglers]; 
            int ans = 0;
            int numSuprises = 0;
            
            for(int i=3; i<input.length; i++){
                scores[i-3] = Integer.parseInt(input[i]);
            }
            
            for(int score : scores){
                if(score % 3 == 0){
                    if(score != 0){
                        int highscoreWithSup = score / 3 + 1;
                        int highscoreNoSup = score / 3;
                        if(highscoreNoSup >= neededScore){
                            ans++;
                        }
                        else if(highscoreWithSup >= neededScore && numSuprises < maxNumSuprises){
                            ans++;
                            numSuprises++;
                        }
                    }
                    else{//score==0
                        if(0 >= neededScore){
                            ans++;
                        }
                    }
                }
                else if(score % 3 == 1){
                    int highscoreWithSup = score / 3 + 1;
                    int highscoreNoSup = highscoreWithSup;
                    if(highscoreNoSup >= neededScore){
                        ans++;
                    }
                }
                else{
                    int highscoreWithSup = score / 3 + 2;
                    int highscoreNoSup = score / 3 + 1;
                    if(highscoreNoSup >= neededScore){
                        ans++;
                    }
                    else if(highscoreWithSup >= neededScore && numSuprises < maxNumSuprises){
                        ans++;
                        numSuprises++;
                    }
                }
            }
                    
            bw.append("Case #" + ++count + ": " + ans);
            
            bw.newLine();
        }

        br.close();
        bw.close();
        
    }

}
