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);
        }
    }
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.util.*;
import java.math.*;

/**
 *
 * @author .
 */
public class B {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = Integer.parseInt(in.nextLine());

        int N, S, p;
        int[] googlers;

        for (int kase = 1; kase <= T; kase++) {
            N = in.nextInt();
            S = in.nextInt();
            p = in.nextInt();

            googlers = new int[N];

            for (int i = 0; i < N; i++) {
                googlers[i] = in.nextInt();
            }

            Arrays.sort(googlers);

            //-------------------------------
            int max = 0;

            int temp = 3 * p - 2; // first check for all unsurprising results

            int position;

            for (position = N - 1; position >= 0; position--) {
                if (googlers[position] >= temp) {
                    max++;
                } else {
                    break;
                }
            }

            if (temp == 1) {
                temp = 1;
            } else {
                temp = 3 * p - 4;
            }

            while (position >= 0 && S > 0) {
                if (googlers[position] >= temp) {
                    max++;
                    S--;
                } else {
                    break;
                }
                position--;
            }

            //-----------------------------

            pl("Case #" + kase + ": " + max);

        }
    }

    public static void pf(String s, Object... o) {
        System.out.printf(s, o);
    }

    public static void pl(Object o) {
        System.out.println(o);
    }

    public static void pr(Object o) {
        System.out.print(o);
    }
}
