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;

import jp.ne.sakura.yuki2006.CodeJam.CodeJam;
import jp.ne.sakura.yuki2006.CodeJam.ITestCase;

/**
 *
 */

/**
 * @author yuki
 *
 */
public class DancingWithTheGooglers implements ITestCase {

	/*
	 * (é Javadoc)
	 *
	 * @see jp.ne.sakura.yuki2006.CodeJam.ITestCase#testCase(java.util.Scanner)
	 */
	@Override
	public String testCase(Scanner stdIn) {
		int N = stdIn.nextInt();
		int S = stdIn.nextInt();
		int P = stdIn.nextInt();
		int overCount = 0;
		int under = 0;
		for (int i = 0; i < N; i++) {
			int t = stdIn.nextInt();
			if (3 * P - 2 <= t) {
				overCount++;
			} else if (2 <= P && 3 * P - 4 <= t) {
				if (under < S) {
					under++;
				}
			}
		}

		return (overCount + under) + "";
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new CodeJam(new DancingWithTheGooglers(), "Bout.txt");
	}

}
