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 google.codejam;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class Stark_B {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new FileReader("B.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
		
		int total = sc.nextInt();
		
		
		
		for(int i=0; i<total; i++){
			pw.print("Case #" + (i + 1) + ": ");
			
			int cases = sc.nextInt();
			int surprise = sc.nextInt();
			int thold = sc.nextInt();
			
			int done=0;
			int cant=0;
			int mid=0;
			int ans=0;
			
			
			
			for(int j=0; j<cases; j++){
				int temp = sc.nextInt();
				
				int x = temp/3;
				int y = temp%3;
				
				if(x>=thold || (x==(thold-1) && y>0))	done++;
				else	if(((x==(thold-1)&&y==0)||(x==(thold-2) && y==2))&&(x>0))	mid++;
				else	cant++;
				
			}
			
			if(surprise<mid)	ans=done+surprise;
			else	ans = done+mid;
			
			
			pw.println(ans);
		}
			
	
			
			
			
		
		pw.flush();
		pw.close();
		sc.close();
	}
	
	

}
