import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


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

public class B {
    private int maxNonSurprise(int v) {
        switch (v % 3) {
            case 0: return v / 3;
            case 1:
            case 2: return v / 3 + 1;
            default: throw new AssertionError();
        }
    }

    private int maxSurprise(int v) {
        if (v <= 2) {
            return v;
        }
        switch (v % 3) {
            case 0:
            case 1: return v / 3 + 1;
            case 2: return v / 3 + 2;
            default: throw new AssertionError();
        }
    }

    public void run(Scanner in, PrintWriter out, int nCase) {
        int n = in.nextInt();
        int s = in.nextInt();
        int p = in.nextInt();
        int alreadyP = 0;
        int potentialP = 0;
        for (int i = 0; i < n; ++i) {
            int v = in.nextInt();
            if (maxNonSurprise(v) >= p) {
                ++alreadyP;
            } else {
                if (maxSurprise(v) >= p) {
                    ++potentialP;
                }
            }
        }
        int ans = alreadyP + Math.min(s, potentialP);
        out.printf("Case #%d: %d%n", nCase, ans);
    }

    public static void main(String[] args) throws FileNotFoundException {
        String filename = B.class.getSimpleName().toLowerCase();

        Scanner in = new Scanner(new File(filename + ".in"));
        PrintWriter out = new PrintWriter(filename + ".out");

        int nCases = in.nextInt();

        for (int i = 1; i <= nCases; ++i) {
            new B().run(in, out, i);
        }

        out.close();
        in.close();
    }
}
