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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;

/**
 *
 * @author Nikhil
 */
public class b {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        File fInput = new File(args[0]);
        String tmp;
        if (fInput.exists() && fInput.isFile()) {
            BufferedReader br = new BufferedReader(new FileReader(fInput));
            int iTestCases = Integer.parseInt(br.readLine());
            int iCase = 1;
            while (null != (tmp = br.readLine())) {
                Danscore d = new Danscore(tmp);
                d.solve();
                System.out.println("Case #" + iCase + ": " + d);
                iCase++;
            }
            br.close();
        }
    }
}

class Danscore {

    private int iBestScoreDancers;
    private int iDancers;
    private int iSurprises;
    private int iBestScore;
    private List<Integer> scores;

    Danscore(String tmp) {
        String[] inp = tmp.split(" ");
        iDancers = Integer.parseInt(inp[0]);
        iSurprises = Integer.parseInt(inp[1]);
        iBestScore = Integer.parseInt(inp[2]);
        scores = new ArrayList<Integer>();
        for (int i = 3; i < inp.length; i++) {
            scores.add(Integer.parseInt(inp[i]));
        }
        Collections.sort(scores, Collections.reverseOrder());
    }

    void solve() {
        iBestScoreDancers = 0;
        // Minimum score required to qualify as best score + has Surprises
        int iMinimumReq = iBestScore + (iBestScore - 2) + (iBestScore - 2);
        // Make sure minimum required score is positive
        iMinimumReq = iMinimumReq<0? 0:iMinimumReq;
        // Normal scores required if Suprises are exausted
        int iNormalScore = iBestScore + (iBestScore - 1) + (iBestScore - 1);
        iNormalScore = iNormalScore<0? 0:iNormalScore;

        Iterator<Integer> itr = scores.iterator();
        while (itr.hasNext()) {
            int iscore = itr.next();
            if (iscore < iBestScore) continue;
            if (iscore >= iNormalScore) {
                iBestScoreDancers++;
                continue;
            }
            if (iSurprises > 0 && iscore >= iMinimumReq) {
                iBestScoreDancers++;
                iSurprises--;
            }
        }
    }

    @Override
    public String toString() {
        return String.valueOf(iBestScoreDancers);
    }
}
