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

public class GoogleDancers {
    static BufferedWriter bw = null;
    static long time = System.currentTimeMillis();

    public static void main(String[] args) throws Exception {
        try {
            Scanner sc = new Scanner(new File("B-small-attempt0.in"));
            bw = new BufferedWriter(new FileWriter("output.txt"));
            long totalCases = sc.nextLong();
            for (int i = 1; i <= totalCases; i++) {
                long numContestants = sc.nextLong();
                long numSurprises = sc.nextLong();
                long maxScore = sc.nextLong();
                long minSurpriseTotalScore = maxScore + getMinimumScore(maxScore, 2) + getMinimumScore(maxScore, 2);
                long minTotalScore = maxScore + getMinimumScore(maxScore, 1) + getMinimumScore(maxScore, 1);
                long qualifiers = 0;
                for (int j = 0; j < numContestants; j++) {
                    long nextScore = sc.nextLong();
                    if ((nextScore >= minTotalScore)) {
                        qualifiers++;
                    } else if (((nextScore < minTotalScore) && ((nextScore >= minSurpriseTotalScore) && (numSurprises > 0)))) {
                        qualifiers++;
                        numSurprises--;
                    }
                }
                bw.append("Case #" + i + ": ");
                bw.append(String.valueOf(qualifiers));
                bw.append("\n");
            }

        } catch (Exception e) {
            e.printStackTrace();
        } finally {

            bw.flush();
            bw.close();
            System.out.println((System.currentTimeMillis() - time) / 1000);
        }

    }

    private static long getMinimumScore(long maxScore, long subtract) {
        return (maxScore - subtract) < 0 ? 0 : (maxScore - subtract);
    }

}
