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 sun.reflect.generics.tree.Tree;

import java.util.ArrayList;
import java.util.List;

public class MathUtil {
    static List<Integer> convertToBase (int num, int base) {
        ArrayList<Integer> integers = new ArrayList<>();
        if (num == 0) {
            integers.add(0);
            return integers;
        }

        while (num!=0) {
            integers.add(num % base);
            num /= base;
        }

        return integers;
    }

    static int sumList(Iterable<Integer> iterable) {
        int sum = 0;
        for (Integer integer : iterable) {
            sum += integer;
        }
        return sum;
    }

    static int sumSquaredList(Iterable<Integer> iterable) {
        int sum = 0;
        for (Integer integer : iterable) {
            sum += integer * integer;
        }
        return sum;
    }
}
