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;
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancingwiththegooglers;

import java.io.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;

/**
 *
 * @author ÐÐ¸ÑÐ¸Ð»Ð» Ð¸ ÐÐ°Ð¿Ð°
 */
public class DancingWithTheGooglers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("input.in")));
            BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output.txt")));
            int numOfTestCases = Integer.parseInt(br.readLine());
            for (int testCaseI = 0; testCaseI < numOfTestCases; testCaseI++) {
                StringTokenizer st = new StringTokenizer(br.readLine());
                int n = Integer.parseInt(st.nextToken());
                int s = Integer.parseInt(st.nextToken());
                int p = Integer.parseInt(st.nextToken());
                int[] t = new int[n];
                for (int i = 0; i < n; i++) {
                    t[i] = Integer.parseInt(st.nextToken());
                }
                int res = 0;
                int availableSurp = s;
                for (int i = 0; i < t.length; i++) {
                    int bestRes = (t[i] + 2) / 3;
                    if ((bestRes < p) && (availableSurp > 0) && (t[i] >= 2)) {
                        int r = (t[i] + 4) / 3;
                        if (r >= p) {
                            bestRes = r;
                            availableSurp--;
                        }
                    }
                    res += ((bestRes >= p) ? 1 : 0);
                }
                bw.write("Case #" + (testCaseI + 1) + ": " + res);
                bw.newLine();
            }
            br.close();
            bw.close();
        } catch (Exception ex) {
            ex.printStackTrace();
        }
    }
}
