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.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Dance {
	
	public static void main(String[] args) {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		try {
			FileWriter fstream = new FileWriter("Dance.txt");
			BufferedWriter out = new BufferedWriter(fstream);
			int noTestCases = Integer.parseInt(in.readLine());
			for (int i = 1; i <= noTestCases; i++) {
				out.write("\nCase #" + i + ": ");
				String[] inputs = in.readLine().split(" ");
				int surprise = Integer.parseInt(inputs[1]);
				int minMark = Integer.parseInt(inputs[2]);
				int result = 0;
				List<Integer> lessmarks = new ArrayList<Integer>();
				for (int j = 3; j < inputs.length; j++) {
					int div = Integer.parseInt(inputs[j]) / 3;
					int mod = Integer.parseInt(inputs[j]) % 3;
					if (mod > 0) {
						div++;						
					}
					if (div >= minMark) {
						result++;
					} else if (Integer.parseInt(inputs[j]) > 0) {
						lessmarks.add(Integer.parseInt(inputs[j]));
					}
				}
				if (surprise > 0 && !lessmarks.isEmpty()) {
					int ite = 0;
					for (int z = 0; z < lessmarks.size() && surprise > 0; z++) {
						ite++;
						if (ite > lessmarks.size() * 3 && surprise == Integer.parseInt(inputs[1])) {
							break;
						}
						int mark = lessmarks.get(z);
						int div = mark / 3;
						int mod = mark % 3;
						if (mod > 0) div++;
						if (minMark - div > 2) continue;
						div++;
						if (div >= minMark) {
							result++;
							lessmarks.remove(z);
						}
						surprise--;
						if (z + 1 == lessmarks.size() && surprise > 0) {
							z = 0;
						}
					}
				}
				out.write(Integer.toString(result));
			}
			out.close();
		} catch (NumberFormatException e) {
				e.printStackTrace();
		} catch (IOException e) {
				e.printStackTrace();
		}
		
	}

}
