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.Scanner;

public class dance
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int test = 1, i, j;
int[] arr = new int[100];
int[] arr1 = new int[100];
while (test <= n ) {
	int N_G = sc.nextInt();
	int N_S = sc.nextInt();
	int query = sc.nextInt();
	int count = 0;
	int surprize_count = 0;
	for(i = 0 ; i < N_G ; i++)
		arr[i] = sc.nextInt();
	int total = 0;
	int temp = query-1;
	int temp1 = query-2;
	for(i = 0 ; i < N_G ; i++){
		if(arr[i]/3 >= query || (arr[i]/3 == query-1 && arr[i]%3 > 0))
			total++;
		else if(N_S > 0 && ((arr[i]/3 == temp1 && arr[i]%3 == 2) || (arr[i]/3 == temp && temp != 0))){
			N_S--;
			total++;
			}
		}
	arr1[test-1] = total;
	test++;
	}
for(i = 1 ; i <= n ; i++)
	System.out.println("Case #" +i+": "+arr1[i-1]);
}
}
