package code12.qualification;

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

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;


public class Dan {
	
	static Scanner sc;
	static Writer out;
	public static void main(String[] args) throws IOException {
		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;
		out = new OutputStreamWriter(new FileOutputStream("out.txt"));
		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);
		}
		
		out.close();
		//System.out.println("Done");
	}
	static void compute(int[] scores, int num_of_googlers,
			int num_of_surp_tup, int max_best_eval, int case_num) throws IOException {
		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);
		out.append("Case #"+case_num+": "+winners+"\n");
	}

}
