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.ArrayList;
import java.util.Arrays;
public class Problem2
{
    public int countResults(String[] nums){
        int googlers = Integer.parseInt(nums[0]);
        int surprising = Integer.parseInt(nums[1]);
        int min = Integer.parseInt(nums[2]);
        int count = 0;
        int[] possible = new int[googlers];
        System.out.println("Min: "+min+", Surprising: "+surprising);
        for(int i = 3; i<nums.length;i++){
            int curr = Integer.parseInt(nums[i]);
            System.out.println("Curr: "+curr);
            if(curr<=1){
                if(min==0){
                    count+=1;
                }
                else if(curr==1&&min==1){
                    count+=1;
                }
                continue;
            }
            switch(curr%3){
                case 0:
                    if(curr/3+1==min){
                        possible[i-3]=1;
                    }
                    else if(curr/3>=min){
                        count+=1;
                    }
                    break;
                case 1:
                    if(curr/3+1>=min){
                        count+=1;
                    }
                    break;
                case 2:
                    if(curr/3+1>=min){
                        count+=1;
                    }
                    else if(curr/3+2>=min){
                        possible[i-3]=1;
                    }
            }
            System.out.println("Count: "+count+", possible: "+possible[i-3]);
        }
        Arrays.sort(possible);
        for(int j=0;j<surprising;j++){
            System.out.println("Switching "+possible[possible.length-1-j]);
            count+=possible[possible.length-1-j];
        }
        System.out.println("Final Count "+count);
        return count;
    }
    public void solve(){
        ReadWriter rw = new ReadWriter();
        ArrayList<String> input = rw.readFile("B-large.in");
        ArrayList<String> ans = new ArrayList<String>();
        int num;
        boolean first = true;
        int count=0;
        for(String s : input){
            if(first){
                num=Integer.parseInt(s);
                first=false;
            }
            else{
                String[] nums = s.split(" ");
                ans.add("Case #"+count+": "+countResults(nums));
            }
            count++;
        }
        rw.writeFile(ans, "output2.txt");
    }
}
