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.IOException;
import java.io.PrintStream;
import java.util.Scanner;

// Qualification Round 2012
// Problem A

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		Scanner sc = null;
		try {
			sc = new Scanner(new File("B-small.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		PrintStream output = null;

		try {
			output = new PrintStream(new File("B-small.out"));
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		int[][] maxScores = new int[31][2];

		for(int i = 0; i < 31; i++){
			maxScores[i][0] = (int) Math.round((i + 1) / 3.0);
			if(i < 2 || i > 28)
				maxScores[i][1] = -1;
			else
				maxScores[i][1] = (int) Math.round((i + 3) / 3.0);
		}
		
		int cases = sc.nextInt();
		sc.nextLine();

		for(int c = 0; c < cases; c++){
			int googlers = sc.nextInt();
			int surprises = sc.nextInt();
			int p = sc.nextInt();

			int count = 0;

			for(int s = 1; s <= googlers; s++){
				int score = sc.nextInt();
				
				if(maxScores[score][0] >= p)
					count++;
				else if (maxScores[score][1] >= p && surprises > 0){
					count++;
					surprises--;
				}
			}

			System.out.printf("Case #%d: %s\n", c + 1, count);
			output.printf("Case #%d: %s\n", c + 1, count);
		}

	}
}