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.*;

public class GoogleDancer {
	public static void main(String[] args) throws IOException
	{
		Scanner sc = new Scanner(new FileReader("Dancer.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("Dancer.out"), true);
		int T = sc.nextInt();
		for (int c = 1; c<=T; c++)
		{
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			int[] points = new int[N];
			for (int d = 0; d < N; d++)
			{
				points[d] = sc.nextInt();
			}
			int num = calc(N, S, p, points);
			String x = String.format("Case #%d: %d", c, num);
			pw.println(x);
		}
		
		
		pw.close();
	}
	public static int calc(int N, int S, int p, int[] points)
	{
		int total = 0;
		int min = ((p-2)<0? 0 : p-2)*2 + p;
		for (Integer n : points)
		{
			
			if (n < min) continue;
			int avg = n/3;
			if (n%3 == 0)
			{
				if (avg >= p) total++;
				else if ((avg+1) >= p && S>0)
				{
					total++;
					S--;
				}
			}else if (n%3 == 1)
			{
				if ((avg+1) >= p)total++;
			}else
			{
				if ((avg+1) >= p) total++;
				else if ((avg+2)>= p && S > 0)
				{
					total++;
					S--;
				}
			}
		}
		return total;
	}
}
