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.Scanner;

public class Googlers {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int cases = sc.nextInt();
		for (int x = 0; x < cases; x++) {
			sc.nextLine();
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int posibles = 0;
			for (int i = 0; i < n; i++) {
				int ti = sc.nextInt();
				if (ti < p)
					continue;
				//if (ti == 3 * p || ti == 3 * p - 1 || ti == 3 * p - 2)
				if (ti >= 3 * p - 2)
					posibles++;
				else if (s > 0 && (ti >= 3 * p - 4)) {
					posibles++;
					s--;
				}
			}
			System.out.println("Case #" + (x+1) + ": " + posibles);
		}
	}
}
