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

import java.io.*;
import java.util.regex.Pattern;

/**
 * @author aoboturov
 */
public class DansingWithGooglers {

    public LineNumberReader lineNumberReader;

    public DansingWithGooglers(final String inputFileName) throws Exception {
        lineNumberReader = new LineNumberReader(
                new BufferedReader(
                        new InputStreamReader(
                                getClass().getClassLoader().getResourceAsStream(inputFileName)
                        )
                ));
    }

    public int readNumberOfTestCases() throws Exception {
        return Integer.parseInt(lineNumberReader.readLine());
    }

    public void solve(final String outputFileName) throws Exception {
        final FileOutputStream fos = new FileOutputStream(new File(outputFileName));

        final int numberOfTestCases = readNumberOfTestCases();
        final Pattern pattern = Pattern.compile("[\\s]+");
        for ( int caseNumber = 1; caseNumber <= numberOfTestCases; caseNumber++) {
            // Init of counters.
            int guaranteedNumberOfGooglersHavingBestResult = 0;
            int holdOutNumberOfGooglersHavingBestResult = 0;
            // Init of base parameters.
            final String[] splitInput = pattern.split(lineNumberReader.readLine());
            final int numberOfGooglers = Integer.parseInt(splitInput[0]);
            final int numberOfSurprises = Integer.parseInt(splitInput[1]);
            final int requiredBestResult = Integer.parseInt(splitInput[2]);
            // Compute required values.
            for ( int googler = 0; googler < numberOfGooglers; googler++) {
                final int googlerScore = Integer.parseInt(splitInput[3 + googler]);
                // Filter evident cases:
                if ( googlerScore >= 3*requiredBestResult) {
                    guaranteedNumberOfGooglersHavingBestResult++;
                    continue;
                }
                if ( googlerScore <= (3*requiredBestResult - 5)) {
                    continue;
                }
                // case p=k,k,k
                if ( googlerScore == (3*requiredBestResult - 0)) {
                    guaranteedNumberOfGooglersHavingBestResult++;
                    continue;
                }
                // case p=k,k+1,k+1
                if ( googlerScore == (3*requiredBestResult - 1) && (googlerScore - 2) >= 0) {
                    guaranteedNumberOfGooglersHavingBestResult++;
                    continue;
                }
                // case p=k,k,k+1
                if ( googlerScore == (3*requiredBestResult - 2) && (googlerScore - 1) >= 0) {
                    guaranteedNumberOfGooglersHavingBestResult++;
                    continue;
                }
                // case p=k,k+1,k+2
                if ( googlerScore == (3*requiredBestResult - 3) && (googlerScore - 3) >= 0) {
                    holdOutNumberOfGooglersHavingBestResult++;
                    continue;
                }
                // case p=k,k+2,k+2
                if ( googlerScore == (3*requiredBestResult - 4) && (googlerScore - 2) >= 0) {
                    holdOutNumberOfGooglersHavingBestResult++;
                    continue;
                }
            }
            final StringBuilder sb = new StringBuilder("Case #").append(caseNumber).append(": ")
                    .append(guaranteedNumberOfGooglersHavingBestResult+Math.min(holdOutNumberOfGooglersHavingBestResult, numberOfSurprises))
                    .append("\n");
            System.out.print(sb.toString());
            fos.write(sb.toString().getBytes());
        }
    }


    public static void main(String args[]) throws Exception {
        new DansingWithGooglers("B-large.in.txt").solve("output.xml");
    }
}
