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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;

public class B {
	public static void main(String[] args) throws IOException{
		BufferedReader in = new BufferedReader(new FileReader(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-large.in")));
		FileWriter out = new FileWriter(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-large.out"));
		//BufferedReader in = new BufferedReader(new FileReader(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-small.in")));
		//FileWriter out = new FileWriter(new File("C:\\Users\\braidon\\Desktop\\CodeJam\\B-small.out"));
		
		int N = new Integer(in.readLine());
		
		for(int c = 1; c <= N; c++){
			int resp = 0;
			String[] sin = in.readLine().split(" ");
			int n = Integer.parseInt(sin[0]);
			int s = Integer.parseInt(sin[1]);
			int p = Integer.parseInt(sin[2]);
			int[] t = new int[n];
			int[] m = new int[n];
			for(int c1 = 3; c1 <= sin.length-1; c1++){
				t[c1-3] = Integer.parseInt(sin[c1]);
			}
			Arrays.sort(t);
			for(int c1 = 3; c1 <= sin.length-1; c1++){
				int ti = t[c1-3];
				m[c1-3] = 0;
				if(ti != 0){
					if(s > 0){
						int a1 = ti/3;
						int a2 = 0;
						if(a1 + 2 <= 10){
							a2 = a1 + 2;
						}else{
							a2 = 10;
							a1 = 8;
						}
						if((a1+a2+a1 == ti)||
								(a1+a2+a2 == ti)||
								(a1+a2+a2-1 == ti)){
							m[c1-3] = a2;
							if(a2 < p){
								m[c1-3] = 0;
							}else{
								s -= 1;
							}
						}
						if(m[c1-3] == 0){
							a1 -= 1;
							a2 = a1 + 2;
							if((a1+a2+a1 == ti)||
									(a1+a2+a2 == ti)||
									(a1+a2+a2-1 == ti)){
								m[c1-3] = a2;
								if(a2 < p){
									m[c1-3] = 0;
								}else{
									s -= 1;
								}
							}
						}
					}
					if(m[c1-3] == 0){
						int a1 = ti/3;
						if(ti%3 == 0){
							m[c1-3] = a1;
						}
						else{
							m[c1-3] = a1+1;
						}
					}
				}
				if(m[c1-3] >= p){
					resp += 1;
				}
			}
			out.write("Case #" + c + ": " + resp + "\n");
		}
		out.flush();
		out.close();
	}
	static void inverter(int[] b){
		int left = 0;
	    int right = b.length-1;
	  
	    while (left < right) {
	      int temp = b[left]; 
	      b[left]  = b[right]; 
	      b[right] = temp;
	     
	      left++;
	      right--;
	    }
	}
}
