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

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancingwithgoogler;

/**
 *
 * @author WC
 */
public class DancingWithGoogler {
	private int numberOfSurprising = 0;
	/**
	 * @param args the command line arguments
	 */
	public static void main(String[] args) {
		(new DancingWithGoogler()).getMaximumBestResults("B-large.in", "B-large.out", "\n");
	}
	
	private void getMaximumBestResults(String filename, String outputFilename, String separator) {
		int numOfTestCases = CodeJamFileManager.getIntFromFirstLineOfFile(filename, separator);
		String[] testCases = CodeJamFileManager.getTextLinesOfFile(filename, separator);
		String output = "";
		for (int i = 1; i <= numOfTestCases; i++) {
			output += "Case #" + i + ": " + getMaximumBestResultOccurence(testCases[i]) + (i != numOfTestCases ? separator : "");
		}
		CodeJamFileManager.saveOutputFile(output, outputFilename, separator);
	}
	
	private int getMaximumBestResultOccurence(String testCase) {
		int[] intFigures = getIntArrayFromString(testCase.split(" "));
		int numberOfGooglers = intFigures[0];
		numberOfSurprising = intFigures[1];
		int bestResultOf = intFigures[2];
		int counter = 3;
		int maxBestResultOccurence = 0;
		boolean canBeSurprising = true;
		while (counter < intFigures.length) {
			if (numberOfSurprising == 0)
				canBeSurprising = false;
			if (googlerHasBestResult(intFigures[counter], bestResultOf, canBeSurprising))
				maxBestResultOccurence++;
			counter++;
		}
		return maxBestResultOccurence;
	}
	
	private boolean googlerHasBestResult(int score, int bestScoreToBeat, boolean canBeSurprising) {
		int remainder = score % 3;
		int avgScore = score / 3;
		if (avgScore >= bestScoreToBeat) {
			return true;
		}
		else  if (bestScoreToBeat - avgScore == 1) {
			if (remainder != 0) {
				return true;
			}
			else if (canBeSurprising && avgScore != 0) {
				numberOfSurprising--;
				return true;
			}
		}
		else if (bestScoreToBeat - avgScore == 2) {
			if (remainder == 2 && canBeSurprising) {
				numberOfSurprising--;
				return true;
			}
			return false;
		}
		return false;
	}
	
	private int[] getIntArrayFromString(String[] intStrArray) {
		int[] intArray = new int[intStrArray.length];
		int i = 0;
		for (String intStr : intStrArray) {
			intArray[i++] = Integer.parseInt(intStr);
		}
		return intArray;
	}
}