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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Scanner;


public class GoogleCodeB {
	public static void main(String args[]) throws Exception {
		FileReader fr = new FileReader("C:/Users/moez/Desktop/B-small-attempt1.in");
		BufferedReader br = new BufferedReader(fr);
		FileWriter fstream = new FileWriter("C:/Users/moez/Desktop/out.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		  int l= 1;
		String s;
		
		int N, S, P, X, Y, nsurp, surp, temp;
		int i = 0;
		int[] t = new int[6];
		String[] st = new String [6];
		br.readLine();
		while((s = br.readLine()) != null) {
			Scanner sc = new Scanner(s);
			i = 0;
			N = sc.nextInt();
			S = sc.nextInt();
			P = sc.nextInt();
			X = 3*P-2;
			Y = ((3*P-4 > 0) ? 3*P-4 : P);
			nsurp = surp= 0;
			for (i=0; i<N ;i++){
				temp = sc.nextInt();
				if ( temp >= X){
					nsurp++;
				}else if ( temp >= Y)
					surp++;
			}
			nsurp+=((surp > S) ? S : surp);		
				
		out.write("Case #"+l+": "+nsurp);
		out.write("\r\n");
		
		
		l++;
		}
		out.close();
		fr.close();
		}
}
