import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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

public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("B-small-attempt1.in"));
		System.setOut(new PrintStream("B-small-attempt1.out"));

		int t = scan.nextInt();
		for (int c = 0; c < t; c++) {
			int n = scan.nextInt(); // num
			int s = scan.nextInt(); // surprising
			int p = scan.nextInt(); // best result cutoff
			int[] totalPoints = new int[n];
			for (int i = 0; i < n; i++)
				totalPoints[i] = scan.nextInt();

			int sUsed = 0;
			int ans = 0;
			for (int i = 0; i < n; i++) {
				int pts = totalPoints[i];
				// can it be done normal?
				if (pts >= p + (p - 1) * 2)
					ans++;
				// can it be done surp?
				else if (pts >= p + Math.max(p - 2, 0) * 2)
					if (sUsed < s) {
						ans++;
						sUsed++;
					}
			}

			System.out.printf("Case #%d: %d%n", c + 1, ans);
		}
	}
}