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 ab.gcj;

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Surprising {

    public static void main(String args[])
    {

        Surprising s = new Surprising();
    }

    public Surprising()
    {
        try{
            BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

            int numOfTests = Integer.parseInt(reader.readLine());
            for(int j = 0 ; j < numOfTests ; j++)
            {
            String[] tstr = reader.readLine().split(" ");
            int numGooglers = Integer.parseInt(tstr[0]);
            int surprising = Integer.parseInt(tstr[1]);
            int p = Integer.parseInt(tstr[2]);
            int [] t = new int[numGooglers];
            for(int i =0 ; i < t.length; i++)
            {
                t[i] = Integer.parseInt(tstr[i+3]);
            }

            System.out.println("Case #"+(j+1)+": "+test(numGooglers,surprising,p,t) );
            }
        }catch(Exception e)
        {

        }
    }

    public int test(int n , int s , int p, int[] t)
    {
        int count = 0 ;
        int surprising = s;

        for(int i = 0 ; i < t.length; i++)
        {
            if(t[i] == 0 )
            {
                if(p == 0) count++;
                continue;
            }
            int a = t[i]/3;
            int b  = a * 3;
            int rem = t[i] - b;
            if(a >= p) {

                count++;
            }
            else
            {
                if((surprising != 0) && rem == 0 && (a + 1 >= p)) {
                    surprising--;
                    count++;
                    continue;
                }
                if( rem == 1 && a+1 >=p)
                {
                    count++;
                }
                if(rem == 2)
                {
                    if(a + 1 >= p )
                    {
                        count++;
                        continue;
                    }
                    if(surprising != 0 && a+2 >=p)
                    {
                        surprising--;
                        count++;
                    }
                }
            }


        }

        return count;

    }
}
