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

public class dancers {
	public static void main(String[] args) {
		try {
			Scanner input = new Scanner(new File("c:\\files\\B-small-attempt0.in"));
			FileWriter fw =  new FileWriter("c:\\files\\douts.txt");
			PrintWriter output = new PrintWriter(fw);
			int n = input.nextInt();
			for(int i=0;i<n;i++)
			{
				
				int noD = input.nextInt();
				int surprise = input.nextInt();
				int points = input.nextInt();
				
				int total[] = new int[noD];
				int count = 0;
				
				for(int j=0;j<noD;j++)
					total[j]=input.nextInt();
				
				for(int j=0;j<noD-1;j++)
					for(int k=j+1;k<noD;k++)
						if(total[j]<total[k])
						{
							int temp=total[j];
							total[j]=total[k];
							total[k]=temp;
						}
				
				for(int dIndex=0;dIndex<noD;dIndex++)
				{
					if(total[dIndex]>=3*points-2)
						count++;
					else if(surprise>0 && (total[dIndex]==3*points-3 || total[dIndex]==3*points-4) && total[dIndex]>0)
					{
						surprise--;
						count++;
					}
					else
						break;
				}
				output.println("Case #"+(i+1)+": "+count);
			}
			output.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
