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

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author administrator
 */
public class DancingGooglers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        String input = "c:\\input.in";
        String output = "c:\\output.txt";
        System.out.println("Hello World");
        DancingGooglers code1 = new DancingGooglers();
        File in = new File(input);
        File out = new File(output);
        code1.processOutput(in, out, "UTF-8");
    }

    public void processOutput(File input, File output, String charSet) {
        String temp = "";
        try {
            Scanner scanner = new Scanner(input, charSet);
            PrintWriter out = new PrintWriter(output);

            int count = 0;
            int test_case = 0;

            while (scanner.hasNext()) {

                String test = scanner.nextLine();
                int noOfGooglers;
                int surprising_triplets;
                int P;
                int t[];

                int surprises_left;
                int result;

                if (count == 0) {
                    test_case = Integer.parseInt(test);
                    count++;
                } else {
                    String[] line_data = test.split("\\s");
                    noOfGooglers = Integer.parseInt(line_data[0]);
                    surprising_triplets = Integer.parseInt(line_data[1]);
                    P = Integer.parseInt(line_data[2]);
                    t = new int[noOfGooglers];

                    result = 0;
                    surprises_left = surprising_triplets;
                    for (int i = 0; i < noOfGooglers; i++) {
                        t[i] = Integer.parseInt(line_data[i + 3]);
                    }
                    for (int i = 0; i < noOfGooglers; i++) {
                        if (isTGreaterThanP(t[i], P)) {
                            result++;
                        } else {
                            if (surprises_left > 0 && isTGreaterPSurprises(t[i], P)) {
                                result++;
                                surprises_left--;
                            }
                        }
                    }
                    System.out.println("Case #" + count + ": " + result);
                    if (count == test_case) {
                        out.print("Case #" + count + ": " + result);
                    } else {
                        out.println("Case #" + count + ": " + result);
                    }

                    count++;

                }
                temp = temp + "\n" + test;
            }
            out.close();
            scanner.close();
        } catch (Exception e) {
            System.out.println("File read/write error");

            return;
        }

    }

    private boolean isTGreaterThanP(int total, int P) {
        int max = (total + 2) / 3;

        if (max >= P) {
            return true;
        }
        return false;
    }

    private boolean isTGreaterPSurprises(int total, int P) {
        int max = (total + 4) / 3;
        if (max >= 10) {
            max = 10;
        }
        if (total == 1) {
            max = 1;
        } else if (total == 0) {
            max = 0;
        }

        if (max >= P) {
            return true;
        }
        return false;
    }
}
