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();

	   }
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package gcj.base;

import java.util.regex.Pattern;

/**
 *
 * @author jalves
 */
public class ProbB {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new ProbB(args).DoIt();
    }

    Console io;
    private ProbB(String[] args) {
        boolean ovwr = false;
        String in = null;
        String out = null;

        for (int i = 0; i < args.length; i++) {
            if (args[i].startsWith("-i")) {
                in = args[i].substring(2);
                if (in.length() == 0) {
                    in = args[++i];
                }
            } else if (args[i].startsWith("-o")) {
                out = args[i].substring(2);
                if (out.length() == 0) {
                    out = args[++i];
                }
            } if (args[i].equals("-f")) {
                ovwr = true;
            }
        }

        io = new Console(in, out, ovwr);
    }

    private void DoIt()  {
        long startTime, remain;
        long nCases;
        io.logt("Starting...");
        try {
            nCases = io.getLong();
            io.log("There are " + nCases + " cases to process\n");
            startTime = System.currentTimeMillis();
            remain = 20000; // just some value
            for (long i = 1; i <= nCases; i++) {
                io.log("\rProcessing test case " + i + "/" + nCases + " : Remaining " + String.format("%.2fs      ", remain/1000.0));

                DoCase(i);

                remain = (long)((System.currentTimeMillis() - startTime) * ((double)nCases/(double)i - 1));
            }
            io.log("\n");
        } catch (Exception ex) {
            io.logt("\n\nERROR: " + ex);
            throw new RuntimeException("Error while executing main loop", ex);
        }
        io.logt("Done!");
    }

    private void DoCase(long caseNum) throws Exception {
        String input;
        int result;
        
        io.print("Case #" + caseNum + ": ");

        int N = (int)io.getLong();
        int surprising = (int)io.getLong();
        int bestScore = (int)io.getLong();
        
        if (bestScore == 0) {
            result = N;
            for (int i = 0; i < N; i++) {
                io.getLong();
            }
        } else {
            result = 0;
            
            int regularThreshold = bestScore * 3 - 3;
            if (regularThreshold < 0) {
                regularThreshold = 0;
            }
            int surpriseThreshold = regularThreshold - 2;
            if (surpriseThreshold < 1) {
                surpriseThreshold = 1;
            }
            
            int score;
            for (int i = 0; i < N; i++) {
                score = (int)io.getLong();
                if (score > regularThreshold) {
                    result++;
                } else if (score > surpriseThreshold) {
                    if (surprising > 0) {
                        surprising--;
                        result++;
                    }
                }
            }
        }

        io.println(String.valueOf(result));
    }
}
