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 net.mauhiz.contest.codejam.qual2012;

import java.io.IOException;

import net.mauhiz.contest.codejam.CodejamLineChunkSolver;

public class DancingGoogler extends CodejamLineChunkSolver {

	public static void main(String... args) throws IOException {
		new DancingGoogler().run(args);
	}

	@Override
	protected String doJamProblem(String[] chunks) {
		int n = Integer.parseInt(chunks[0]);
		int s = Integer.parseInt(chunks[1]);
		int p = Integer.parseInt(chunks[2]);
		int[] t = new int[n];
		for (int i = 0; i < n; i++) {
			t[i] = Integer.parseInt(chunks[3 + i]);
		}
		int y = solve(s, p, t);
		return Integer.toString(y);
	}

	protected int solve(int s, int p, int[] t) {
		log.fine("s " + s);
		log.fine("p " + p);
		int r = s; // remaining surprises
		int y0 = 0, y1 = 0, y2 = 0;
		int t0 = 0, t1 = 0, t2 = 0;
		for (int i = 0; i < t.length; i++) {
			int mod = t[i] % 3;

			switch (mod) {
			case 0:
				t0++;
				int m0 = t[i] / 3;
				if (m0 >= p) {
					y0++;
				} else if (r > 0 && m0 + 1 == p && t[i] >= 3) {
					// consume a surprise
					r--;
					y0++;
				}
				break;
			case 1:
				t1++;
				int m1 = (t[i] + 2) / 3;
				if (m1 >= p) {
					y1++;
				}
				break;
			case 2:
				t2++;
				int m2 = (t[i] + 1) / 3;
				if (m2 >= p) {
					y2++;
				} else if (r > 0 && m2 + 1 == p) {
					// consume a surprise
					r--;
					y2++;
				}
				break;
			}
		}
		log.fine("r " + r);
		log.fine("t0 " + t0);
		log.fine("t1 " + t1);
		log.fine("t2 " + t2);
		log.fine("y0 " + y0);
		log.fine("y1 " + y1);
		log.fine("y2 " + y2);

		return y0 + y1 + y2;
	}

	@Override
	public String getName() {
		return "DancingGoogler";
	}
}
