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

public class ProblemB {
	public static void main(String[] args) throws FileNotFoundException {
		PrintStream out = new PrintStream(new FileOutputStream(new File(
				"b-small.out")));
		Scanner in = new Scanner(new File("B-small-attempt0.in"));

		int T = in.nextInt();

		for (int i = 1; i <= T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();

			int defCount = 0;
			int surpCount = 0;
			for (int j = 0; j < N; j++) {
				int t = in.nextInt();

				if (t % 3 == 0) { // (1,1,1) <-> (0,1,2)
					if (t / 3 >= p)
						defCount++;
					else if (t / 3 >= p - 1 && t / 3 >= 1) // (0,0,0) cannot change
						surpCount++;
				}
				if(t % 3 == 1){ // (0,0,1) -> no way to increase max score
					if(t / 3 >= p - 1) // int div
						defCount++;
				}
				if(t % 3 == 2){ // (0,1,1) <-> (0,0,2)
					if(t / 3 >= p - 1) // int div
						defCount++;
					else if(t / 3 >= p - 2)
						surpCount++;
				}
				
				//System.out.printf("total: %d, avg: %d, dC: %d, sC: %d\n", t, t/3, defCount, surpCount);
			}
			
			out.printf("Case #%d: %d\n", i, defCount + Math.min(surpCount, S));
			
			//System.out.printf("\n\n");
		}

		in.close();
		out.close();
	}
}
