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

import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Code_Jam {

	
	public static void main(String[] args) throws IOException {
		
		
		BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
		FileWriter out= new FileWriter("B-large.out");
		//BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
		int T,S,P,N,C;
		T=Integer.parseInt(in.readLine());
		StringTokenizer x;
		for (int i = 1; i <= T; i++) {
			C=0;
			x=new StringTokenizer(in.readLine());
			N=Integer.parseInt(x.nextToken());
			S=Integer.parseInt(x.nextToken());
			P=Integer.parseInt(x.nextToken());
			int G[]=new int[N];
			for (int j = 0; j < N; j++) {
				G[j]=Integer.parseInt(x.nextToken());
			}
			Arrays.sort(G);
			for (int j = 0; j < N; j++) {
				if(G[j]<P)// may be  <p only
					continue;
				int A,B,D;
				A=P;G[j]-=P;
				B=G[j]/2;
				D=G[j]-B;
				if(D>=10){
				C++;
				continue;
				}
				if(P-B>2)
				continue;
				else if(P-B==2&&S>0){
				C++;
				S--;
				}
				else if(P-B<=1){
				C++;
				}
				
				
			}
			//System.out.println(C);
			out.write("Case #"+i+": "+C+"\n");
			
			
		}
		out.close();	
		
	}
}
