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

}

/*
ID: 14vikra1
LANG: JAVA
TASK: dancescore
*/
import java.io.*;
import java.util.*;

class dancescore {
	public static void main (String [] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("dancescore.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("dancescore.out")));
		int T = Integer.parseInt(br.readLine());
		for (int i = 0; i < T; i++) {
			StringTokenizer st = new StringTokenizer(br.readLine());
			int N = Integer.parseInt(st.nextToken());
			int S = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			int surprise = 0;
			int work = 0;
			for (int j = 0; j < N; j++) {
				int current = Integer.parseInt(st.nextToken());
				if (current%3 != 0 && current >= 2) {
					if (Math.ceil(current/3) + 1 >= p) {
						work++;
					} else if (Math.ceil(current/3) + 2 >= p) {
						surprise++;
					}
				} else if (current >= 2) {
					if (Math.ceil(current/3) >= p) {
						work++;
					} else if (Math.ceil(current/3) + 1 >= p) {
						surprise++;
					}
				} else {
					if (current == 1 && p <= 1) {
						work++;
					} else if (current == 1 && p == 2) {
						surprise++;
					} else if (current == 0 && p == 0) {
						work++;
					}
				}
			}
			int answer = work + Math.min(S, surprise);
			out.println("Case #" + (i+1) + ": " + answer);
		}
		out.close();
		System.exit(0);        
	}
}

