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

public class b {
	static int n,s,p;
	static int[] v;
	static int[][] memo;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int t=1; t<=T; t++) {
			n = in.nextInt();
			s = in.nextInt();
			p = in.nextInt();
			v = new int[n];
			for(int i=0; i<n; i++)
				v[i] = in.nextInt();
			memo = new int[n][s+1];
			for(int[] x : memo) Arrays.fill(x,-1);
			System.out.printf("Case #%d: %d%n", t, go(0,s));
		}
	}
	static int go(int pos, int left) {
		if(left < 0) return -10000;
		if(pos == n) return left == 0 ? 0:-10000;	
		if(memo[pos][left] != -1) return memo[pos][left];
		int best = -10000;
		for(int i=0; i<=10; i++)
			for(int j=i; j<=i+2; j++)
				for(int k=j; k<=i+2; k++)
					if(i+j+k==v[pos]) {
						int sup = 0;
						if(k-i==2) sup = 1;
						int win = 0;
						if(k >= p) win = 1;
						best = Math.max(best,win+go(pos+1,left-sup));
					}
		return memo[pos][left] = best;
	}
}