import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Dan {
	
	static Scanner sc;
	public static void main(String[] args) throws FileNotFoundException {
		sc=new Scanner(new File("input.txt"));
		int num_of_cases=sc.nextInt();
		int num_of_googlers;
		int num_of_surp_tup;
		int max_best_eval;
		int []scores;
		for (int i = 1; i <= num_of_cases; i++) {
			num_of_googlers=sc.nextInt();
			num_of_surp_tup=sc.nextInt();
			max_best_eval=sc.nextInt();
			scores=new int[num_of_googlers];
			for (int k = 0; k < scores.length; k++) {
				scores[k]=sc.nextInt();
			}
			compute(scores,num_of_googlers,num_of_surp_tup,max_best_eval,i);
		}
	}
	static void compute(int[] scores, int num_of_googlers,
			int num_of_surp_tup, int max_best_eval, int case_num) {
		int winners=0;
		for (int i = 0; i < scores.length; i++) {
			if((scores[i] >= max_best_eval*3-2)){//&&(max_best_eval*3-2 >0)){
				winners++;
			}
			else if(num_of_surp_tup>0){
				if((scores[i] >= max_best_eval*3-4)&&(max_best_eval!=1)){//(scores[i] > 0)){
					num_of_surp_tup--;
					winners++;
				}
			}
		}
		System.out.println("Case #"+case_num+": "+winners);
	}

}
