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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class Dancing_With_the_Googlers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
			BufferedWriter out = new BufferedWriter(new FileWriter("B-large.out"));
			Dancing_With_the_Googlers x = new Dancing_With_the_Googlers();
			String str;
			in.readLine();
			while ((str = in.readLine()) != null) {
				String res = x.convert(str);
				out.write(res+"\n");
			}
			in.close();
			out.close();
		} catch (IOException e) {
			e.printStackTrace();
			}
	}
	int count=1;
	String convert(String in)
	{
		String op[] = in.split(" ");
	    int no_of_googlers = Integer.parseInt(op[0]);
	    int suprisingTriplets = Integer.parseInt(op[1]);
	    int bestresult = Integer.parseInt(op[2]);
		int current_googler_score = 0;
		int valid_score  = 0;
		int min_best_score = bestresult+2*(bestresult-1);
		if (min_best_score == 0){ valid_score = no_of_googlers;return "Case #"+(count++)+": "+valid_score;}
		int sup =0;
		for (int i=0; i<no_of_googlers; i++){
		current_googler_score = Integer.parseInt(op[3+i]);
			if ( current_googler_score >= min_best_score) {
			valid_score++;
			}
			else if ( current_googler_score == min_best_score-1 || current_googler_score == min_best_score-2 ){
			if ( current_googler_score != 0){
			sup++;
			}
			}
		}
		if( suprisingTriplets <= sup ){
		valid_score = valid_score + suprisingTriplets;
		}
		else {
		valid_score = valid_score + sup;
		}
		return "Case #"+(count++)+": "+valid_score;
	}
	
}
