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.io.*;
import java.util.*;

public class Dancing {

    public static void main(String [] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
        BufferedWriter brw = new BufferedWriter(new FileWriter("output"));
        int t = Integer.parseInt(br.readLine().trim());
        int n = 1;
        while(t-- > 0)
        {
            Scanner sc = new Scanner(br.readLine());
            int N = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int sum1 = p + p-2 + p-2;
            int sum2 = p + p - 1 + p -1;
            int ans = 0;
            while(sc.hasNext())
            {
                int a = sc.nextInt();
                if ( s>0 && (sum1>1) && (a ==sum1 || a ==sum1+1))
                {
                    s--;
                    ans++;
                }
                else if ( a >= sum2)
                    ans++;
            }
            brw.write("Case #"+n+": "+ans + "\n");
            n++;
        }
        brw.close();


    }
}
