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.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public Scanner sc;
	public Map<Character, Character> mapping = new HashMap<Character, Character>();

	public static void main(String[] args) {
		Main m = new Main();
		m.start();
	}

	public void start() {
		sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int i = 1; i <= t; i++) {
			System.out.print("Case #" + i + ": ");
			solve();
		}
	}

	public void solve() {
		int ans = 0;
		int n = sc.nextInt();
		int s = sc.nextInt();
		int p = sc.nextInt();
		for (int i = 0; i < n; i++) {
			int t = sc.nextInt();
			if (calcMax(t, false) >= p) {
				ans++;
				continue;
			}

			if (s > 0 && calcMax(t, true) >= p) {
				ans++;
				s--;
				continue;
			}
		}
		System.out.println(ans);
	}

	public int calcMax(int t, boolean suprising) {

		if (t == 0) {
			return 0;
		}

		int max = 0;
		switch (t % 3) {
		case (0):
			max = t / 3;
			if (suprising) {
				max++;
			}
			break;
		case (1):
			max = (int) t / 3 + 1;
			break;
		case (2):
			max = (int) t / 3 + 1;
			if (suprising) {
				max++;
			}
			break;
		}
		return max;
	}
}
