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;

/**
 * Created by IntelliJ IDEA.
 * User: Linkov Mikl
 * Date: 15.04.12
 * Time: 2:51
 * To change this template use File | Settings | File Templates.
 */
public class ProblemB {
    public static void main(String [] args) {
        Scanner scanner = new Scanner(System.in);

        int testCount = scanner.nextInt();

        for (int i = 0; i < testCount; i++) {
            int n = scanner.nextInt();
            int s = scanner.nextInt();
            int p = scanner.nextInt();
            int answer = 0;
            for (int j = 0; j < n; j++) {
                int point = scanner.nextInt();
                int flag = 0;
                int max1 = -1;
                int max2 = -1;
                for (int k1 = 0; k1 < 11; k1++) {
                    for (int k2 = 0; k2 < 11; k2++) {
                        for (int k3 = 0; k3 < 11; k3++) {
                            if (k3 + k2 + k1 == point) {
                                if ((Math.abs(k3 - k2) < 3) && (Math.abs(k1 - k2) < 3) && (Math.abs(k3 - k1) < 3)) {

                                    if ((Math.abs(k3 - k2) == 2) || (Math.abs(k2 - k1) == 2) || (Math.abs(k3 - k1) == 2)) {
                                        flag = 1;
                                        max1 = Math.max(k1, max1);
                                        max1 = Math.max(k2, max1);
                                        max1 = Math.max(k3, max1);
                                    } else {
                                        max2 = Math.max(k1, max2);
                                        max2 = Math.max(k2, max2);
                                        max2 = Math.max(k3, max2);
                                    }
                                }
                            }
                        }
                    }
                }

                if (max2 >= p) {
                    answer++;
                } else {
                    if (s > 0) {
                        if (max1 >= p) {
                            answer++;
                            s--;
                        }
                    }
                }
            }
            System.out.println("Case #" + (i + 1) + ": " + answer);
        }
    }
}
