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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.Reader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Set;


public class Main 
{

public static HashMap<Character,Character> mapp = new HashMap<Character,Character>();

public static void main(String[] args) throws Exception
{
	PrintWriter writer = new PrintWriter(new FileWriter("output.txt"));
	BufferedReader input = new BufferedReader(new FileReader("B-large.in"));
	int size=Integer.parseInt(input.readLine());
	for(int i=0; i<size; i++)
	{
		String testCase = input.readLine();
		String tokens[] = testCase.split(" ");
		int N = Integer.parseInt(tokens[0]);
		int S = Integer.parseInt(tokens[1]);
		int p = Integer.parseInt(tokens[2]);
		int count=0;
		//ArrayList<Integer> google = new ArrayList<Integer>();
		for(int j=3; j<N+3; j++)
		{
			int testNum = Integer.parseInt(tokens[j]);
			if((testNum - p) >= 2*(p-1) && (testNum-p)>=0)
			{
				count++;
			}
			else if((testNum - p) < 2*(p-1) && (testNum-p)>=0)
			{
				if(S!=0 && (testNum - p) >= 2*(p-2) )
				{
					count++;
					S--;
				}
			}
		}
		writer.println("Case #"+(i+1)+": "+count);
	}
	writer.close();
	input.close();
}

}