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.Arrays;
import java.util.Scanner;

/**
 * @author Dmitry Levshunov (levshunov.d@gmail.com)
 */
public class TaskB {
    private static final int INF = 1000 * 1000 * 1000;

    private static final int[] BEST_NON_SURPRISING = new int[31];
    private static final int[] BEST_SURPRISING = new int[31];

    private static int n;
    private static int p;
    private static int[] scores = new int[100];
    private static int[][] dp = new int[100][101];

    public static void main(String[] args) throws Exception {
        init();

        Scanner scanner = new Scanner(System.in);

        int tests = Integer.parseInt(scanner.nextLine().trim());

        for (int test = 1; test <= tests; test++) {
            n = scanner.nextInt();
            int s = scanner.nextInt();
            p = scanner.nextInt();

            for (int i = 0; i < n; i++) {
                scores[i] = scanner.nextInt();
            }

            for (int i = 0; i < n; i++) {
                Arrays.fill(dp[i], -1);
            }

            System.out.printf("Case #%d: %s", test, get(0, s));
            System.out.println();
        }

        scanner.close();
    }

    private static void init() {
        for (int i1 = 0; i1 <= 10; i1++) {
            for (int i2 = i1; i2 <= 10 && i2 - i1 <= 2; i2++) {
                for (int i3 = i2; i3 <= 10 && i3 - i1 <= 2; i3++) {
                    int sum = i1 + i2 + i3;

                    if (i3 - i1 == 2) {
                        BEST_SURPRISING[sum] = Math.max(BEST_SURPRISING[sum], i3);
                    } else {
                        BEST_NON_SURPRISING[sum] = Math.max(BEST_NON_SURPRISING[sum], i3);
                    }
                }
            }
        }
    }

    private static int get(int pos, int s) {
        if (s < 0) {
            return -INF;
        }

        if (pos == n) {
            return s == 0 ? 0 : -INF;
        }

        if (dp[pos][s] != -1) {
            return dp[pos][s];
        }

        int bestNonSurprising = BEST_NON_SURPRISING[scores[pos]];
        int bestSurprising = BEST_SURPRISING[scores[pos]];

        int result = get(pos + 1, s) + (bestNonSurprising >= p ? 1 : 0);
        if (bestSurprising != -1) {
            result = Math.max(result, get(pos + 1, s - 1) + (bestSurprising >= p ? 1 : 0));
        }

        return dp[pos][s] = result;
    }
}
