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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;

public class DancingWithGooglers {

	public static void main(String[] args) throws IOException {
		String msg = "";
		BufferedReader br = null;
		String sCurrentLine = null;
		Map<String, String> map = new HashMap<String, String>();
		br = new BufferedReader(new FileReader("test"));
		sCurrentLine = br.readLine();
		int x = 0;
		if (sCurrentLine != null) {
			while ((sCurrentLine = br.readLine()) != null) {
				int qualifiedGooglers = 0;
				msg = "";
				String[] eachTestCase = sCurrentLine.split(" ");
				int noOfGooglers = Integer.parseInt(eachTestCase[0]);
				int noOfSurprises = Integer.parseInt(eachTestCase[1]);
				int minReqd = Integer.parseInt(eachTestCase[2]);
				int[] googlersPoint = new int[noOfGooglers];
				int k = 0;
				for (int i = 3; i < eachTestCase.length; i++) {
					int j = Integer.parseInt(eachTestCase[i]);
					googlersPoint[k++] = j;
				}
				for (int i = 0; i < noOfGooglers; i++) {
					if (googlersPoint[i] == 0) {
						if (minReqd == 0)
							qualifiedGooglers++;
					} else if ((googlersPoint[i] + 2) / 3 >= minReqd) {
						qualifiedGooglers++;
					} else if (noOfSurprises > 0) {
						if ((googlersPoint[i] + 4) / 3 >= minReqd) {
							qualifiedGooglers++;
							noOfSurprises--;
						}

					}
				}
				x++;
				msg += "Case #" + x + ": " + qualifiedGooglers;
				System.out.println(msg);
			}
		}

	}
}
