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

public class Qualify {

	public static void main(String[] args) {
		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File("B-small-attempt3.in")));
			int cases = Integer.parseInt(reader.readLine());
			for (int d = 0; d < cases; d++) {

				// parse
				String line = reader.readLine();
				String[] spLine = line.split(" ");
				int googs = Integer.parseInt(spLine[0]);
				int surprises = Integer.parseInt(spLine[1]);
				int prize = Integer.parseInt(spLine[2]);
				Googler[] googArr = new Googler[googs];

				// find the solutions for each googler
				for (int r = 0; r < googs; r++) {
					googArr[r] = new Googler();
					Integer total = Integer.parseInt(spLine[(r + 3)]);
					googArr[r].poss(total, prize);

				}

				// sort the array based on how many possibilities it has
				Arrays.sort(googArr, new Comparator<Googler>() {
					@Override
					public int compare(Googler o1, Googler o2) {
						// TODO Auto-generated method stub
						return new Integer(o1.trueCounter)
								.compareTo(o2.trueCounter);
					}
				});

				int surCounter = 0;
				int winCounter = 0;
				/*
				 * boolean prizeSurprise = false; boolean prizeNoSurprise =
				 * false; boolean failSurprise = false; boolean failNoSurprise =
				 * false;
				 */
				for (int i = 0; i < googs; i++) {
					if (googArr[i].trueCounter == 1) {
						if (googArr[i].prizeSurprise == true) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
						} else if (googArr[i].prizeNoSurprise == true) {
							winCounter++;
							googArr[i].used = true;
						} else if (googArr[i].failSurprise == true) {
							surCounter++;
							googArr[i].used = true;
						} else {
							// nothing to do with this
							googArr[i].used = true;
						}
					}
				}

				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeSurprise == true && googArr[i].prizeNoSurprise == false) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
							break;
						}
					}
				}
				
				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeSurprise == true) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
							break;
						}
					}
				}

				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].failSurprise == true) {
							surCounter++;
							googArr[i].used = true;
						}
					}
				}

				for (int i = 0; i < googs; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeNoSurprise) {
							winCounter++;
							googArr[i].used = true;
						}
					}
				}

				System.out.println("Case #" + (d+1) + ": " + winCounter);

			}

		} catch (Exception ex) {
			ex.printStackTrace();
		}

	}

}
