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.*;

public class Dancing {
	private static Scanner s = new Scanner(System.in);

	public static void main(String[] args) {
		int T = s.nextInt();

		for (int t = 0; t < T; t++) {
			int N = s.nextInt();
			int S = s.nextInt();
			int p = s.nextInt();

			int[] sums = new int[N];
			boolean[] satisfied = new boolean[N];

			for (int i = 0; i < N; i++) sums[i] = s.nextInt();

			for (int i = 0; i < N; i++) {
				int low = Math.max(p - 1, 0);
				if (p + low * 2 > sums[i]) continue;
				satisfied[i] = true;
			}

			for (int i = 0; i < N; i++) {
				if (S == 0) break;
				if (satisfied[i]) continue;
				int low = Math.max(p - 2, 0);
				if (p + low * 2 > sums[i]) continue;
				satisfied[i] = true;
				S--;
			}

			int max = 0;
			for (int i = 0; i < N; i++)
				if (satisfied[i])
					max++;

			System.out.printf("Case #%d: %d\n", t + 1, max);
		}
	}
}
