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;


public class B {

    static int[][] dp; // dp[i][j]: iäººç®ã¾ã§çµãã£ãã»ãã¨jåsurprize
    static void solve(int casee, Scanner sc) {
        int n = sc.nextInt();
        int s = sc.nextInt();
        int p = sc.nextInt();
        int[] t = new int[n];
        for (int i = 0; i < n; i++) {
            t[i] = sc.nextInt();
        }
        dp = new int[n+1][s+1];
        for (int i = 0; i < n; i++) {
            boolean alwaysGood = (t[i] + 2) / 3 >= p;
            boolean goodWhenSurprizing = p == 0 || t[i] >= 2 && (t[i] + 4) / 3 >= p;
            if (alwaysGood) {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j] + 1;
                }
            }
            else if (goodWhenSurprizing) {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j];
                }
                for (int j = s; j >= 1; j--) {
                    dp[i+1][j-1] = Math.max(dp[i+1][j-1], dp[i][j] + 1);
                }
            }
            else {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j];
                }
            }
        }
        int max = 0;
        for (int i = 0; i <= s; i++) {
            max = Math.max(max, dp[n][i]);
        }
        System.out.println("Case #" + (casee+1) + ": " + max);
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            solve(i, sc);
        }
        
    }

}
