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.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class GCJ2012QB {
	static int[] a = new int[100];

	public static void main(String[] args) throws Exception {
		BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(System.out);
		StringTokenizer st;
		int t = Integer.parseInt(r.readLine());
		int n, s, p, a, result, best;
		for (int i = 1; i <= t; i++) {
			st = new StringTokenizer(r.readLine());
			n = Integer.parseInt(st.nextToken());
			s = Integer.parseInt(st.nextToken());
			p = Integer.parseInt(st.nextToken());
			result = 0;
			for (int j = 0; j < n; j++) {
				a = Integer.parseInt(st.nextToken());
				best = maxBest(a);
				if (best >= p) {
					result++;
				} else {
					if (s > 0) {
						best = maxBestWithSurprise(a);
						if (best >= p) {
							result++;
							s--;
						}
					}
				}
			}
			pw.println("Case #" + i + ": " + result);
		}
		pw.flush();
	}

	private static int maxBestWithSurprise(int a) {
		if (a == 0) {
			return 0;
		} else {
			return (a + 4) / 3;
		}
	}

	private static int maxBest(int a) {
		return (a + 2) / 3;
	}
}
