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 info.stephenn.codejam2012.qualify;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class B {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		int cases = sc.nextInt();
		
		for(int caseX=1; caseX <= cases; caseX+=1){
			int nGoogles = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			List<Integer> gTot = new ArrayList<Integer>();
			for (int i = 0; i < nGoogles; i++){
				gTot.add(sc.nextInt());
			}
			int y = doit(gTot, s,p);
			System.out.println("Case #"+caseX+": "+y);
		}
	}
	
	public static int doit(List<Integer> gTot, int s, int p){
		Collections.sort(gTot);
		
		int y=0;
		
		for (int i=0; i < gTot.size(); i++){
			if (greatestNonSurprising(gTot.get(i)) < p){
				if (s > 0){
					if (greatestSurprising(gTot.get(i)) >= p){
						y +=1;
						s -=1;
					}
				}
			} else {
				y += ((gTot.size()) - (i));
				break;
			}
		}
		
		return y;
	}
	
	public static int greatestSurprising(int gTot){
		int x = gTot / 3;
		if ((gTot %3) == 0 && gTot > 2 ) x +=1;
		if ((gTot % 3) == 1) x+=1;
		else if ((gTot % 3) == 2) x+=2;
		return x;
	}
	
	public static int greatestNonSurprising(int gTot){
		int x = gTot/3;
		if ((gTot % 3) > 0) x+=1;
		if (x > 10){
			//shouldnt happen, .
			return 10;
		} else{
			return x;
		}
	}
}