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

public class Main {
	public static int problemC(Vector<Integer> V,int N,int S,int P)
	{
		int Nbr=0;
		for(int i=0;i<N;i++)
		{
			if((3*P-2)<=V.elementAt(i))
				Nbr++;
			else if((3*P-4)<=V.elementAt(i)&&0<S&&0<=(3*P-4))
			{
				Nbr++;
				S--;					
			}
		}
		return Nbr;
	}
	public static void main(String[] args) throws FileNotFoundException {
		Scanner in =new Scanner(new File("B-small.in"));
		PrintWriter out=new PrintWriter("B-small.out");
		int T,N,S,P;
		T=in.nextInt();
		for(int i=0;i<T;i++)
		{
			N=in.nextInt();
			S=in.nextInt();
			P=in.nextInt();
			Vector<Integer> V = new Vector<Integer>();			
			for(int j=0;j<N;j++)
				V.add(in.nextInt());
			out.print("Case #"+(i+1)+": ");
			out.print(problemC(V,N,S,P));
			if(i+1!=T) out.println("");
		}
		out.close();
		in.close();
	}
}