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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class ProblemB {
	public static void main(String args[]) throws IOException{
		File file = new File("I:/res/ACMCS/GCJ/B-large.in");
		File outFile = new File("I:/res/ACMCS/GCJ/problemB.out.txt");
		FileWriter fw = new FileWriter(outFile);
		BufferedWriter bw = new BufferedWriter(fw);
		//FileReader fileReader = new FileReader(file);
		Scanner in = new Scanner(file);
		int cs = in.nextInt();
		int c = 0;
		while(cs -- > 0){
			++ c;
			int ans = 0;
			int n = in.nextInt();
			int map[] = new int[n];
			int s = in.nextInt();
			int p = in.nextInt();
			for(int i = 0; i < n; ++ i)
				map[i] = in.nextInt();
			ans = ProblemB.ans(map, s, p);
			bw.write("Case #");
			bw.write(String.valueOf(c));
			bw.write(": ");			
			bw.write(String.valueOf(ans));
			bw.newLine();
		}
		bw.close();
	}
	
	public static int suprise(int triSco){
		int max = (triSco + 4) / 3 + 1;
		int min = triSco / 3  -1 > 0 ? triSco / 3  -1 : triSco / 3;
		int sco = 0;
		for(int i = max; i >= min; -- i){
			sco = triSco - i;
			for(int j = (sco + 2) / 2 + 1; j >= (sco) / 2 - 1; -- j){
				int k = sco - j;
				if(Math.abs(i - j) <= 2 && Math.abs(i - k) <= 2 && Math.abs(j - k) <= 2 && i >= 0 && j >= 0 && k >= 0)
					return Math.max(Math.max(i, j), k);
			}
		}
		return max;
	}
	
	public static int nonSuprise(int triSco){
		int max = (triSco + 2) / 3 + 1;
		int min = triSco / 3 - 1;
		int sco = 0;
		for(int i = max; i >= min; -- i){
			sco = triSco - i;
			for(int j = (sco + 1) / 2 + 1; j >= (sco) / 2 - 1; -- j){
				int k = sco - j;
				if(Math.abs(i - j) <= 1 && Math.abs(i - k) <= 1 && Math.abs(j - k) <= 1 && i >= 0 && j >= 0 && k >= 0)
					return Math.max(Math.max(i, j), k);
			}
		}
		return max;
	}
	
	public static int ans(int map[], int s, int p){
		int max = 0;
		for(int i : map){
			if(nonSuprise(i) >= p)
				++ max;
			else if(suprise(i) >= p && s > 0){
				++ max;
				-- s;
			}
		}
		return max;
	}
	
}
