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.*;
import java.io.*;

public class q2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		File file = new File("C:/Users/Raja/workspace/GCJ/src/in.txt");
		
		
		int N,S,p;
		int[] sums;
		int norm,surp,ans;
		
		try{
			Scanner s = new Scanner(file);
			int num = Integer.parseInt(s.nextLine());
			for (int i = 0;i<num;i++){
				norm = 0;
				surp = 0;
				N = s.nextInt();
				S = s.nextInt();
				p = s.nextInt();
				sums = new int[N];
				for (int j = 0; j < N; j++){
					sums[j] = s.nextInt();
				}
				Arrays.sort(sums);
				for (int j = 0; j < N; j++){
					if (sums[j] >= 3*p-2)
						norm++;
					else if (sums[j] >= 3*p-4 && sums[j] > 1)
						surp++;
				}
				if (surp > S)
					ans = norm + S;
				else
					ans = norm + surp;
				
				System.out.println("Case #"+(i+1)+": "+ans);
			}
		}
		catch (FileNotFoundException e){
			e.printStackTrace();
		}

	}

}
