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.util.Scanner;

public class CodeJam12B {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        for (int zz = 1; zz <= T; zz++) {
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();

            int[] t = new int[N];
            int out = 0;

            for (int i = 0; i < N; i++) {
                t[i] = in.nextInt();
                t[i] = t[i] - p;
                if (t[i] >= 0) {
                    if (t[i] >= 2 * (p - 1)) {
                        out++;
                    } else if (t[i] >= 2 * (p - 2) && S > 0) {
                        S--;
                        out++;
                    }
                }
            }
            System.out.format("Case #%d: %d\n", zz, out);
        }
    }
}
