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 BDanceScores {
    public static void main(String[] args) throws FileNotFoundException {
        Scanner in = new Scanner(new File("blarge.in"));
        //Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter("blarge.out");
        int T = in.nextInt();
        for (int t = 1; t <= T; ++t) {
            int N = in.nextInt(), S = in.nextInt(), p = in.nextInt();
            int bigScores = 0, okScores = 0;
            for (int i = 0; i < N; ++i) {
                int sumScore = in.nextInt();
                int bestScore = (sumScore + 2) / 3;
                if (bestScore >= p) {
                    bigScores++;
                } else if (bestScore == p-1 && sumScore >= 2 && sumScore <= 28 && (sumScore % 3 != 1)) {
                    okScores++;
                }
            }
            int result = Math.min(okScores, S) + bigScores;
            out.println("Case #" + t + ": " + result);
        }
        out.close();
    }
}
