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


public class Dance {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(new File("B-small-attempt1.in"));
		FileWriter fw = new FileWriter("dance.txt");
		int k=0;
		int n = Integer.parseInt(sc.nextLine());
		for(int j = 0; j<n; j++){
			k++;
			String ln = sc.nextLine();
			fw.write("Case #"+k+": ");
			String arr[] = ln.split(" ");
			//int num = Integer.parseInt(arr[0]);
			int s = Integer.parseInt(arr[1]);
			int p = Integer.parseInt(arr[2]);
			int count = 0;
			for(int i=3; i<arr.length; i++){
				int t = Integer.parseInt(arr[i]);
				if(t>=p){
					if(Math.max(0, 3*p-2) <= t)
						count++;
					else if (Math.max(0, 3*p-4) <= t && s>0){
						count++;
						s--;
					}
				}
			}
			fw.write(count+"\n");

		}
		sc.close();
		fw.close();
	}

}
