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 BS {

	public static void main(String args[]) {
		Scanner in = new Scanner(System.in);
		
		int count = in.nextInt();
		for (int i = 1; i <= count ; i++) {
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int p_count = 0;
			int s_count = 0;
			for (int j = 0; j < n; j++) {
				int current = in.nextInt();
				int rest = current - p;
				if (rest < 0) {
					continue;
				}
				int restOf2p = rest - (p * 2);
				if (restOf2p >= -2) {
					p_count++;
					continue;
				}
				if (restOf2p >= -4) {
					s_count++;
				}
			}
			if (s_count > s) {
				s_count = s;
			}
			System.out.format("Case #%d: %d\n",i,p_count + s_count);
		}
	}

}

