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.
 */


import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author bilal
 */
public class Googler {

    static String[] inputBuffer;
    static int testCasesCount = 0;

    public Googler(InputStream is) {
        Scanner scanner = new Scanner(is);
        testCasesCount = scanner.nextInt();
        inputBuffer = new String[testCasesCount];
        int loopCounter = 0;
        scanner.nextLine();
        while (scanner.hasNextLine()) {
            String nextTestCase = scanner.nextLine();
            inputBuffer[loopCounter] = nextTestCase;
            loopCounter++;
            if (loopCounter == testCasesCount) {
                break;
            }
        }
    }

    public void solve_Googlers(String[] input) {
        int solution = 0;
        int googlers;
        int surprisingCases;
        int targetHighestScore;
        for (int i = 0; i < input.length; i++) {//iterate over all test cases
            System.out.print("Case #" + (i + 1) + ": ");
            solution = 0;
            StringTokenizer st = new StringTokenizer(input[i]);
            googlers = Integer.parseInt(st.nextToken());
            surprisingCases = Integer.parseInt(st.nextToken());
            targetHighestScore = Integer.parseInt(st.nextToken());
            //create Score objects from remaining tokens
            LinkedList<Integer> sortedScores = new LinkedList<Integer>();
            while (st.hasMoreTokens()) {
                sortedScores.add(Integer.parseInt(st.nextToken()));
            }
            Collections.sort(sortedScores);
            //traverse over sorted collection
            for (int j = googlers - 1; j >= 0; j--) {

                int totalScore = sortedScores.get(j);
                int j1 = (int) Math.ceil(totalScore / 3.0);
                int j2 = (int) Math.ceil((totalScore - j1) / 2.0);
                int j3 = totalScore - j1 - j2;
                //System.out.println(">>>>>"+j1+" "+j2+" "+j3);
                //
                if (j1 >= targetHighestScore) {//this googler scored the higheest target score
                    solution++;
                    continue;
                }
                if (surprisingCases <= 0) {
                    break;//no more surpising cases -> no more solutions
                }
                //deal with surprising cases
                if (j1 == j2 && (j1 + 1) >= targetHighestScore && j2 > 0) {
                    surprisingCases--;
                    solution++;
                }
            }

            System.out.print(solution);
            if (i != input.length - 1) {
                System.out.println();
            }
            //break;//deal with only first case
        }


    }

    public static void main(String[] args) {
        Googler goolger = new Googler(System.in);
        goolger.solve_Googlers(inputBuffer);
    }

    class Scores {

        int totalScore;
        int j1, j2, j3;

        public Scores(int totalScore, int j1, int j2, int j3) {

            this.totalScore = totalScore;
            this.j1 = j1;
            this.j2 = j2;
            this.j3 = j3;
        }
    }
}

