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

}

/*
 a = y    b = n    c = f    d = i    e = c    f = w    g = l    h = b    i = k    j = u    k = o     l = m     m = x    n = s    o = e
 p = v    q = z    r = p    s = d    t = r    u = j    v = g    w = t    x = h    y = a    z = q
*/
import java.util.*;
public class Dancing  {
    
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        sc.nextLine();
        
        for (int i = 0; i < T; i++)
        {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            
            int AWESOME = p + 2*(p-1);
            int SURP_GOOD = p + 2*(p-2);
            
            System.out.print("Case #" + (i + 1) + ": ");
            
            int goodOnes = 0;
            int[] curr = new int[N];
            for (int j = 0; j < N; j++)
            {
                curr[j] = sc.nextInt();
            }
            Arrays.sort(curr);
            for (int j = N-1; j >= 0; j--)
            {
                if (p == 0)
                    goodOnes++;
                else if (curr[j] >= AWESOME && curr[j] > 0)
                    goodOnes++;
                else if (curr[j] > 0 && S > 0 && curr[j] >= SURP_GOOD)
                {
                    goodOnes++;
                    S--;
                }
            }
            System.out.println(goodOnes);
        }
    }
}