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

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package test2;

import java.util.LinkedList;

/**
 *
 * @author Student
 */
public class Best {

    public static LinkedList<Score> scores(int som) {
        LinkedList<Score> res = new LinkedList<Score>();
        int x = som / 3;
        switch (som % 3) {
            case 0: {
                res.add(new Score(x, x, x,!true));
                res.add(new Score(x - 1, x + 1, x,!false));
                break;
            }
            case 1: {
                res.add(new Score(x, x, x + 1,!true));
                res.add(new Score(x - 1, x + 1, x + 1,!false));
                break;
            }
            case 2: {
                res.add(new Score(x, x, x+2,!false));
                res.add(new Score(x, x + 1, x+1,!true));
                break;
            }
        }
        if(!res.getFirst().isValid()) res.removeFirst();
        if(!res.getLast().isValid()) res.removeLast();
        return res;
    }
    
    public static int opt(int n,int s,int p,LinkedList<Integer> l){
        LinkedList<Score> lg=new LinkedList<>();
        int restofs=s;
        for(Integer i:l){
            LinkedList<Score> xxx=scores(i);
            switch(xxx.size()){
                case 1: {
                     if(xxx.getFirst().isbetter(p)) lg.add(xxx.getFirst());
                    break;
                }
                    
                case 2: {
                    if(xxx.getFirst().isSurprising()){
                        if(xxx.getFirst().isbetter(p)&& restofs!=0&&!xxx.getLast().isbetter(p)){
                        lg.add(xxx.getFirst());
                        restofs--;
                        break;
                        }
                    }
                    if(xxx.getLast().isSurprising()){
                        if(xxx.getLast().isbetter(p)&& restofs!=0&&!xxx.getFirst().isbetter(p)){
                        lg.add(xxx.getLast());
                        restofs--;
                        break;
                        }
                    }
                   if(xxx.getLast().isbetter(p)&&!xxx.getLast().isSurprising()){
                        lg.add(xxx.getLast());
                        break;
                   }
                   if(xxx.getFirst().isbetter(p)&&!xxx.getFirst().isSurprising()){
                        lg.add(xxx.getFirst());
                        break;
                   }
                    }
                }

            }
       
        return lg.size();
        
    }
}