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 codejam12;

import java.io.*;
import java.util.StringTokenizer;

/**
 *
 * @author Mohamed Ibrahim (MIM)
 */
public class Problem_B {
    public static void main(String[] args) throws IOException {
        
        BufferedReader r = new BufferedReader(new FileReader("B-large.in"));
        PrintWriter w = new PrintWriter(new BufferedWriter(new FileWriter("B-large.out")));
        
        int nCases = Integer.parseInt(r.readLine());
        
        for (Integer k = 1; k <= nCases; k++) {
            int ret=0;
            w.print("Case #" + k + ": ");
            String line=r.readLine();
            StringTokenizer st = new StringTokenizer(line);
            int n= Integer.parseInt(st.nextToken());
            int more= Integer.parseInt(st.nextToken());
            int p= Integer.parseInt(st.nextToken());
            
            for (int i = 0; i <n; i++) {
                int cur= Integer.parseInt(st.nextToken());
                int div=cur/3;
                int rem=cur-div*3;
                if(p==0){
                    ret=n;
                    break;
                }
                if(cur==0)continue;
                if(div>=p)ret++;
                else{
                    if(p-div==1 && rem>0)ret++;
                    else if(p-div==1 && more>0){
                        ret++;
                        more--;
                    }
                    else if(p-div==2 && rem==2 && more>0){
                        ret++;
                        more--;
                    }
         /*           else if(p-div==2 && more>0 && rem>0){
                        ret++;
                        more--;
                    }*/
                }
            }
            
            w.println(ret);
        }
        w.close();
        
        
    }
}
