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

	   }
}


import java.util.Scanner;
import java.io.*;
import java.util.LinkedList;

/**
 * A program to simulate a Snapper
 *
 *
 * @see Google CodeJam
 *
 * @since 8 may 2010
 * @version 1.0
 * @author ididi, Jeroen van Oorschot
 */
public class Dancers {

    Scanner sc;
    String fileName = "B-large";
    File file = new File(fileName + ".in");
    FileWriter out;
    PrintWriter output;
    /* the snapper checker
     * 
     * @pre true
     * @post true
     */

    public void snapper() {
        try {
            sc = new Scanner(file);
        } catch (FileNotFoundException e) {
            System.out.println("no input file found");
            System.out.println(fileName + ".in");
        }
        try {
            out = new FileWriter(fileName + ".out");
        } catch (IOException e) {
            System.out.println(e.getMessage());
        }
        output = new PrintWriter(out);
        int tries = sc.nextInt();
        sc.nextLine();
        for (int i = 1; i <= tries; i++) {
            output.print("Case #" + i + ": ");
            run();
            output.println();
        }
        try {
            out.close();
        } catch (IOException e) {
            System.out.println(e.getMessage());
        }


    }

    public void run() {
        int n = sc.nextInt();
        int s = sc.nextInt();
        final int p = sc.nextInt();
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            if (t / 3 >= p) {
                ans++;
            } else if (t / 3 == p - 2 && t % 3 == 2 && s > 0) {
                ans++;
                s--;
            } else if (t / 3 == p - 1) {
                if (t % 3 == 2 || t % 3 == 1) {
                    ans++;
                } else if (s > 0 && t > 0) {
                    ans++;
                    s--;
                }
            }
        }
        output.print(ans);
    }

    public static void main(String[] args) {
        new Dancers().snapper();
    }
}
