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.*;

public class Dancing {
    private final int[] total_scores;
    private final int superising_count;

    public Dancing(int[] total_scores, int superising_count) {
        this.total_scores = total_scores;
        this.superising_count = superising_count;
    }

    public static void main(String[] args) throws IOException {
        InputStream is;
        if (args.length > 0) {
            is = new FileInputStream(args[0]);
        }else{
            is = System.in;
        }

        BufferedReader inputReader = new BufferedReader(new InputStreamReader(is));
        String firstLine = inputReader.readLine();
        int count_of_cases = Integer.parseInt(firstLine);

        for (int idx_of_case = 1; idx_of_case <= count_of_cases; idx_of_case++) {
            String caseLine = inputReader.readLine();
            String[] numbers = caseLine.split(" ");

            int numbers_of_googler = Integer.parseInt(numbers[0]);
            int superising_count = Integer.parseInt(numbers[1]);
            int at_least = Integer.parseInt(numbers[2]);

            int[] total_scores = new int[numbers_of_googler];
            for (int idx = 0; idx < numbers_of_googler; idx++) {
                total_scores[idx] = Integer.parseInt(numbers[3+idx]);
            }

            int count = new Dancing(total_scores, superising_count).count_of_greater_than(at_least);

            System.out.println(String.format("Case #%d: %d", idx_of_case, count));
        }

    }

    public int count_of_greater_than(int at_least) {
        int supersed_count = 0;
        int count=0;
        for (int idx = 0; idx < total_scores.length; idx++) {
            int score = total_scores[idx];

            int max_score = 0;
            int average = score / 3;
            if (average * 3 == score) {
                max_score = average;
            }else{
                max_score = average+1;
            }

            if (max_score >= at_least) {
                count++;
            }else{
                int left = score - at_least;
                if (left > 0 && supersed_count < superising_count ) {
                    if ((left / 2) * 2 == left && at_least - left / 2 == 2) {
                        supersed_count++;
                        count++;
                    }
                    if (left == 2 * at_least -3 ) {
                        supersed_count++;
                        count++;
                    }
                }
            }


        }
        return count;

    }
}
