/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.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-small-attempt0";
    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();
    }
}
