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.Arrays;
import java.util.Scanner;

public class DanceJudging {
	
	public static int count(int[] totalPoints, int numSurprise, int target) {
		final int totalMin = target + ((target >= 1) ? (target - 1) : 0) * 2;
		final int surpriseTotalMin = target + ((target >= 2) ? (target - 2) : 0) * 2;
		int count = 0;
		Arrays.sort(totalPoints);
		for (int i = totalPoints.length - 1; i >= 0; i--) {
			if (totalPoints[i] >= totalMin) {
				count++;
			} else if (numSurprise > 0 && totalPoints[i] >= surpriseTotalMin) {
				numSurprise--;
				count++;
			} else {
				break;
			}
		}

		return count;
	}
	
	public static void main(String[] args) {
		final Scanner in = new Scanner(System.in);
		final int numCase = in.nextInt();
		in.nextLine();
		int numGoogler, numSurprise, target;
		int[] totalPoints;
		for (int i = 0; i < numCase; i++) {
			numGoogler = in.nextInt();
			numSurprise = in.nextInt();
			target = in.nextInt();
			totalPoints = new int[numGoogler];
			for (int j = 0; j < numGoogler; j++) {
				totalPoints[j] = in.nextInt();
			}
			System.out.println("Case #" + (i+1) + ": " + count(totalPoints, numSurprise, target));
			in.nextLine();
		}
	}
}
