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

public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T, N, S, p, t, y;
		int[] min = new int[31];
		int[] max = new int[31];
		min[0] = max[0] = 0;
		max[1] = 1;
		int cont = 1;
		for (int i = 1; i < 28; i+= 3) {
			min[i] = min[i + 1] = min[i + 2] = cont++;
			max[i + 1] = max[i + 2] = max[i + 3] = cont;
		}
		min[28] = min[29] = min[30] = max[29] = max[30] = 10;
		
		
		/*for (int i = 0; i <= 30; i++)
			System.out.println("i: " + i + ", min: " + min[i] + ", max: " + max[i]);*/
		
		
		T = in.nextInt();
		for (int x = 1; x <= T; x++) {
			y = 0;
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			for (int i = 0; i < N; i++) {
				t = in.nextInt();
				if (min[t] >= p)
					y++;
				else if (S > 0 && max[t] >= p) {
					y++;
					S--;
				}
			}

			System.out.println("Case #" + x + ": " + y);
		}
	}
}
