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.*;
import java.io.*;

public class QR_Blarge {
	public static void main(String[] args) throws Exception{
		// Scanner sc = new Scanner(System.in);
		// PrintWriter pw = new PrintWriter(System.out);
		// Scanner sc = new Scanner(new FileReader("input.in"));
		// PrintWriter pw = new PrintWriter(new FileWriter("output.out"));
		Scanner sc = new Scanner(new FileReader("B-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-large.out"));
		
		
		int T;
		
		int N, S, p;
		int[] t = new int[100];
		int ans;
		
		T = sc.nextInt();
		
		for(int times = 1; times <= T; times++){
			N = sc.nextInt();
			S = sc.nextInt();
			p = sc.nextInt();
			
			for(int i = 0; i < N; i++){
				t[i] = sc.nextInt();
			}
			
			ans = 0;
			
			for(int i = 0; i < N; i++){
				if(t[i] <= 1){
					if(p <= t[i]){
						ans++;
					}
					continue;
				}
				t[i] = t[i] - (p * 3);
				if(t[i] > -3){
					ans++;
				}else if(t[i] > -5 && S > 0){
					ans++;
					S--;
				}
			}
			
			System.out.print("Case #" + times + ": ");
			System.out.print(ans);
			System.out.println();
			
			
			pw.print("Case #" + times + ": ");
			pw.print(ans);
			pw.println();
			
		}
		
		sc.close();
		pw.close();
		
	}
}

