import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}


import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author pulasthi
 */
public class QB12 {

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter("b.txt");
        int T = sc.nextInt();
        for (int i = 0; i < T; i++) {
            int result = 0;
            int N = sc.nextInt(); //no of googlers
            int S = sc.nextInt();   //surprising
            int p = sc.nextInt();   //max score
            int noSCutoff = p * 3 - 2;
            int sCutoff = p * 3 - 4;
            noSCutoff = Math.max(p, noSCutoff);
            sCutoff = Math.max(p, sCutoff);
            for (int j = 0; j < N; j++) {
                int number = sc.nextInt();
                if (number >= noSCutoff) {
                    result++;
                } else if (S > 0 && number >= sCutoff) {
                    S--;
                    result++;
                }
            }
            out.print("Case #" + (i + 1) + ": ");
            out.println(result);
        }
        out.flush();
        out.close();
    }
}
