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 Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);

	int T = sc.nextInt();
	int caseNum = 0;

	while(caseNum++<T){

	    int n = sc.nextInt();
	    int s = sc.nextInt();
	    int p = sc.nextInt();
	    int[] t = new int[n];
	    for(int i=0; i<n; i++){
		t[i] = sc.nextInt();
	    }
	    int[][] triplet = new int[n][3];
	    for(int i=0; i<n; i++){
		triplet[i][0] = t[i]/3;
		triplet[i][1] = t[i]/3;
		triplet[i][2] = t[i]/3;
		int tmp = 0;
		for(int j=t[i]%3; j>0; j--){
		    triplet[i][tmp++]++;
		}
	    }

	    int ans = 0;
	    for(int i=0; i<n; i++){
		if(triplet[i][0]>=p && triplet[i][0]!=triplet[i][1]){
		    ans++; triplet[i][0] = -1;
		}
		else if(triplet[i][0]!=triplet[i][1]){
		    triplet[i][0] = -1;
		}
		else if(triplet[i][0]>=p){
		    ans++; triplet[i][0] = -1;
		}
		else if(triplet[i][1]>0){
		    triplet[i][0]++; triplet[i][1]--;
		}
	    }

	    int count = 0;
	    for(int i=0; i<n; i++){
		if(triplet[i][0]>=p){count++;}
	    }
	    if(count>=s){ans += s;}
	    else {ans += count;}

	    System.out.println("Case #"+caseNum+": "+ans);
	}
    }
}
