import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;


public class GooglersDancer {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		InputStreamReader converter = new InputStreamReader(System.in);
		BufferedReader in = new BufferedReader(converter);
		if (in == null) {
		      return;
		    }
		String numTest = in.readLine();
		int maxCases = Integer.valueOf(numTest);
		for(int i=1;i<= maxCases;i++){
			String linea = in.readLine();
			String[] datos = linea.split(" ");
			Integer googlers = Integer.valueOf(datos[0]);
			Integer sospechosos = Integer.valueOf(datos[1]);
			Integer p = Integer.valueOf(datos[2]);
			Integer puntuacion;
			Integer personas = 0;
			ArrayList<Integer> puntuaciones = new ArrayList<Integer>();
			for(int j=0;j<googlers;j++){
				puntuacion = Integer.valueOf(datos[3+j]);
				puntuaciones.add(puntuacion);
			}
			Integer[] pOrdenado = null;
			pOrdenado = (Integer[]) puntuaciones.toArray(new Integer[puntuaciones.size()]);
			Arrays.sort(pOrdenado);
			int j;
			for(j=pOrdenado.length-1;j>=0;j--){
				if(pOrdenado[j] >= p*3-2){
					personas += 1;
				}else{
					break;
				}
			}
			int posibles = j+1-sospechosos;
			for(;j>=posibles && j>= 0;j--){
				if(pOrdenado[j] >= p*3-4 && pOrdenado[j] > p){
					personas += 1;
				}else{
					break;
				}
			}
			System.out.println("Case #"+i+": "+personas);
		}
	}

}


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