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

public class DancingWithTheGooglers {
	private static final boolean DEBUG = false;
	private static final String FILENAME = "dancing";

	public static void main(String[] args) throws IOException {
		long startTime = System.nanoTime();

		if(DEBUG) {
			System.setIn(new BufferedInputStream(new FileInputStream(FILENAME + "_example.in")));
		} else {
			System.setIn(new BufferedInputStream(new FileInputStream(FILENAME + ".in")));
			System.setOut(new PrintStream(FILENAME + ".out"));
		}

		Scanner sc = new Scanner(System.in);

		int numTestCases = sc.nextInt();
		for(int caseNum = 1; caseNum <= numTestCases; caseNum++) {
			int numGooglers = sc.nextInt();
			int numSurprising = sc.nextInt();
			int scoreMaxLowerBound = sc.nextInt();
			
			int numGooglersWithBetter = 0;
			
			for(int i = 0; i < numGooglers; i++) {
				int totalScore = sc.nextInt();
				
				if(totalScore <= 1) {
					if(totalScore >= scoreMaxLowerBound) {
						numGooglersWithBetter++;
					}
				} else {
					int maxScore;
					if(totalScore % 3 == 0) {
						maxScore = totalScore / 3;
					} else {
						maxScore = totalScore / 3 + 1;
					}
					
					if(maxScore >= scoreMaxLowerBound) {
						numGooglersWithBetter++;
					} else if(numSurprising > 0) {
						maxScore++;
						
						if(maxScore >= scoreMaxLowerBound) {
							numGooglersWithBetter++;
							numSurprising--;
						}
					}
				}
			}
			
			System.out.println("Case #" + caseNum + ": " + numGooglersWithBetter);
		}

		if(DEBUG) System.out.println("Total time: " + ((System.nanoTime() - startTime) / 1000.0 / 1000.0 / 1000.0) + "s");
	}
}