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.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int ti = 0; ti < t; ti++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int result = 0;
			List<Integer> list = new ArrayList<Integer>();
			for (int i = 0; i < n; i++)
				list.add(sc.nextInt());
			Collections.sort(list);

			int ns = n - s;

			for (int k = 0; k <= ns; k++) {
				int tr = 0;
				int j = 0;
				for (; j < k; j++) {
					int tmp;
					if (list.get(j) <= 1)
						tmp = list.get(j);
					else
						tmp = (list.get(j) - 1) / 3 + 1;
					if (tmp >= p)
						break;
				}
				tr += k - j;
				for (j = list.size() - (ns - k); j < list.size(); j++) {
					int tmp;
					if (list.get(j) <= 1)
						tmp = list.get(j);
					else
						tmp = (list.get(j) - 1) / 3 + 1;
					if (tmp >= p)
						break;
				}
				tr += list.size() - j;
				for (j = k; j < list.size() - (ns - k); j++) {
					int tmp;
					if (list.get(j) <= 1)
						tmp = -100;
					else
						tmp = (list.get(j) - 2) / 3 + 2;
					if (tmp >= p)
						break;
				}
				tr += list.size() - (ns - k) - j;
				result = Math.max(result, tr);
			}
			System.out.printf("Case #%d: %d%n", ti + 1, result);
		}
	}
}
