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);
		}
	}

}

package problem_b;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class ProblemB {

	public static void main(String[] args) {
		try {
			processFile("/Users/ibogomolov/Desktop/B-large.in", "/Users/ibogomolov/Desktop/out.txt");
		} catch (IOException e) {
			e.printStackTrace();
		}
	}



	private static int process(int n, int s, int p, int[] total) {
		int res = 0;
		for (int i = 0; i < n; i++) {
			int div = total[i]/3;
			int mod = total[i]%3;
			if (div >= p || (div + 1 >= p && mod >= 1)) {
				res++;
			} else if ((div + 2 >= p && mod == 2 && s > 0) || (div + 1 >= p && div >= 1 && mod == 0 && s > 0)) {
				res++;
				s--;
			}
		}
		return res;
	}

	public static void processFile(String in, String out) throws IOException {
		Scanner scanner = new Scanner(new File(in));
		BufferedWriter writer = new BufferedWriter(new FileWriter(out));
		int cases = scanner.nextInt();
		for (int i = 1; i < cases+1; i++) {
			int n = scanner.nextInt();
			int s = scanner.nextInt();
			int p = scanner.nextInt();
			int[] array = new int[n];
			for (int j = 0; j < n; j++) {
				array[j] = scanner.nextInt();
			}
			writer.write("Case #" + i + ": " + process(n, s, p, array) + "\n");
		}

		scanner.close();
		writer.close();
	}
}
