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.*;
import java.util.*;

public class codejam3 {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        File file = new File("B-small-attempt0.in");
        FileReader fr = new FileReader(file);
        Scanner ob = new Scanner(fr);
        File outFile = new File("outFile3.txt");
        FileWriter outFilew = new FileWriter(outFile);
        int t, r = 1;
        t = ob.nextInt();
        while (t != 0) {
            int n, s, p, count = 0;
            n = ob.nextInt();
            s = ob.nextInt();
            p = ob.nextInt();
            int a[] = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = ob.nextInt();
                if (a[i] >= p) {
                    if (a[i] >= 3 * p - 2) {
                        count++;
                    } else if ((a[i] == 3 * p - 4 || a[i] == 3 * p - 3) && s != 0) {
                        s--;
                        count++;
                    }
                }
            }
            System.out.println(count);
            outFilew.append("Case #"+r+": "+count+"\n");
            t--;
            r++;
        }
        outFilew.close();
    }
}
