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 B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int nbr_case = scan.nextInt();
		for(int i = 0; i < nbr_case; i++)
		{
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int possible_max = 0;
			int curr =0;
			//int[] vec = new int[N];
			for( int j = 0; j<N;j++)
			{
				
				curr = scan.nextInt();
				if(S> 0)
				{
					if(curr > (p*3 - 3) && (curr >= p))
					{
						possible_max++;
					}					
					else
					{
						if(curr > (p*3-5) && (curr >= p))
						{
							possible_max++;
							S--;
						}
						
					}
					
				}
				else
				{
					
					if(curr > (p*3 - 3) && (curr >= p))
					{
						possible_max++;
					}
					
				}
				

					//vec[j] = scan.nextInt();				
			}
			//System.out.println(vec.toString());
			System.out.format("Case #%d: %d\n", i+1, possible_max);
		}
		

	}

}
