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.util.*;
import java.io.*;

public class Dancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();

		for (int i = 1; i<=cases; i++) {
			int n = in.nextInt(); // number of googlers
			int s = in.nextInt(); // number of surprising triplets
			int p = in.nextInt(); // ??
			
			int[] points = new int[n];
			for (int j = 0; j<n; j++)
				points[j] = in.nextInt();

			// lowest possible unsurprising triplet:
			// p, p-1, p-1

			// lowest possible surprising triplet:
			// p, p-2, p-2

			int answer = 0;
			int possible = 0;
			int lowUn = lowestUnsurprising(p);
			int lowSu = lowestSurprising(p);
			for (int j = 0; j<n; j++) {
				if (points[j] >= lowUn) answer++;
				else if (points[j] >= lowSu) possible++;
			}

			answer += Math.min(possible, s);
			System.out.println("Case #"+i+": "+answer);
		}
	}

	public static int lowestUnsurprising(int p) {
		return p + (Math.max(p-1, 0))*2;
	}

	public static int lowestSurprising(int p) {
		return p + (Math.max(p-2, 0))*2;
	}
}
