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

import java.util.Arrays;
import java.util.Scanner;

public class B {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long times = Integer.parseInt(sc.nextLine());
		for (long n = 0; n < times; n++) {
			String b = sc.nextLine();
			String[] bb = b.split(" ");
			int N = Integer.parseInt(bb[0]);
			int S = Integer.parseInt(bb[1]);
			int P = Integer.parseInt(bb[2]);
			Score[] score = new Score[N];
			for (int i = 0; i < N; i++) {
				score[i] = new Score(Integer.parseInt(bb[3 + i]));
			}
			Arrays.sort(score);
			int ret = 0;
			for (int i = 0; i < N; i++) {
				if (score[i].score[0] >= P)
					ret++;
				else {
					if (S > 0) {
						score[i].adjust();
						if (score[i].valid() && score[i].score[0]>=P) {
							ret++;
							S--;
						}

					}
				}
			}
			System.out.println("Case #" + (n + 1) + ": " + ret);
		}
	}
}

class Score implements Comparable<Score> {
	int[] score = new int[3];

	public Score(int s) {
		int q = s / 3;
		int r = s % 3;
		Arrays.fill(score, q);
		for (int i = 0; i < r; i++) {
			score[i] += 1;
		}
	}

	public boolean valid() {
		int max = Math.max(score[0], score[1]);
		max = Math.max(max, score[2]);
		int min = Math.min(score[0], score[1]);
		min = Math.max(min, score[2]);
		return max - min <= 2;
	}

	public void adjust() {
		if (score[0] == 0)
			return;
		if (score[2] > 0) {
			score[0]++;
			score[2]--;
			return;
		}
		if (score[1] > 0) {
			if (score[0] + 1 - score[2] <= 2
					&& score[0] + 1 - (score[1] - 1) <= 2) {
				score[0]++;
				score[1]--;
			}
		}
	}

	@Override
	public int compareTo(Score s1) {
		return s1.score[0] - this.score[0];
	}

}
