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 IO;

/**
 *
 * @author dannocz
 */
public class TestCase {
    
    private int noGooglers;
    private int p;
    private Googler[] googlers;

    public TestCase(String testCase) {
        String[] cads=testCase.split(" ");
        noGooglers = Integer.parseInt(cads[0]);
        int surprisedCases = Integer.parseInt(cads[1]);
        p = Integer.parseInt(cads[2]);
        googlers= new Googler[noGooglers];
        
        for (int i = 0; i < noGooglers; i++) {
            int score=Integer.parseInt(cads[i+3]);
            googlers[i]=new Googler(score, surprisedCases);
            buildTripplets(googlers[i]);
        }
        
    }

    
    public TestCase(int noGooglers, int surprisedCases, int p) {
        this.noGooglers = noGooglers;
        this.p = p;
        this.googlers= new Googler[noGooglers];
    }
    
   
    
    public int result(){
        int total=0;
        for (Googler googler : googlers) {
            if(googler.result(p))
                total++;
        }
        
        return total;
    }

    private void buildTripplets(Googler googler) {
        
        int score = googler.getScore();        
        for(int hp = p; hp<=10; hp++)
        {
            int x= score-hp;
            for(int y1=0;y1<=hp;y1++){
            //for(int y1=hp;y1>=hp-2;y1--){
                int y2 = x-y1;
                if(validTripplet(score,hp,y1,y2))
                    googler.addTriplet(new Triplet(hp,y1,y2));
            }
        }               
    }

    private boolean validTripplet(int score,int hp, int y1, int y2) {
        
        return (hp+y1+y2)==score &&
                validPair(hp,y1) && validPair(hp,y2) && validPair(y1,y2);
        
    }
    
    private boolean validPair(int y1, int y2){
          
        if(y1<0 || y2<0 || y1>10 || y2>10)
            return false;
        
        int r= y1-y2;
        return (r<=2 && r>=-2);
    }
}