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

}

package com.vlad;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class B {
    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(new File(args[0]));
        FileWriter writer = new FileWriter("b-out.txt");
        int T = scanner.nextInt();
        for(int i=0;i<T;i++) {
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int P = scanner.nextInt();
            int[] RES = new int[N];
            
            for(int j=0;j<N;j++) {
                RES[j] = scanner.nextInt();
            }

            if(i>0) {
                writer.append("\n");
            }
            writer.append("Case #"+(i+1)+": " + solve(N,S,P,RES));
        }
        writer.flush();
    }

    private static int solve(int n, int s, int p, int[] res) {
        int num = 0;
        int surLeft = s;
        for(int i=0;i<n;i++) {
            if(p+Math.max(0,p-1)*2<=res[i]) {
                num++;
            } else {
                if(surLeft>0) {
                    if(p+Math.max(0,p-2)*2<=res[i]) {
                        surLeft--;
                        num++;
                    }
                }
            }
        }
        return num;
    }
}
