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

public class Main {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(new File("in"));

		scan.nextLine();// removes int at start

		int counter = 0;

		while (scan.hasNextInt()) {
			
			counter++;
			
			// initialize
			int numDancers = scan.nextInt();
			int numSurp = scan.nextInt();
			int best = scan.nextInt();

			int[] dancers = new int[numDancers];

			for (int i = 0; i < numDancers; i++) {
				dancers[i] = scan.nextInt();
			}

			// do the checks
			
			if (best==0) {
				System.out.println("Case #"+counter+": "+numDancers);
				
			}
			else if (best==1){
				int cnt = 0;
				for (int i = 0; i < numDancers; i++){
					if (dancers[i]!=0) {
						cnt++;
					}
				}
				System.out.println("Case #"+counter+": "+cnt);
			}
			else{

			int count1 = 0, count2 = 0;

			for (int i = 0; i < numDancers; i++) {
				int score = dancers[i];
				if (score >= 3 * best - 2 && 3*best - 2>=0) {
					count1++;
				} else if (score >= 3 * best - 4 && 3*best-4>=0) {
					count2++;
				}
			}

			if (count2 <= numSurp) {
				System.out.println("Case #"+counter+": "+ (int)(count1 +count2));
			}
			else{
				System.out.println("Case #"+counter+": "+ (int)(count1+numSurp));
			}

		}

	}
	}

}
