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

public class DanceGoogler {

    public static void main(String[] args) {
        DanceGoogler d = new DanceGoogler();
        Scanner in = new Scanner(System.in);
        int cases = in.nextInt();
        for (int i = 0; i < cases; i++) {
            System.out.printf("Case #%d: %d\n", i+1, d.solve(in));
        }
    }
    
    private int solve(Scanner in) {
	int N = in.nextInt();
	int S = in.nextInt();
	int p = in.nextInt();
	int[] scores = new int[N];
	for (int i = 0; i < N; i++) scores[i] = in.nextInt();
	int count = 0;
	for (int i = 0; i < scores.length; i++) {
	    if (scores[i] < p) continue;
	    double diff = p - (scores[i] - p) / 2.0;
	    if (diff > 2.0) continue;
	    if (diff > 1.0) {
		if (S > 0) {
		    S--;
		    count++;
		}
		else continue;
	    }
	    else count++;
	}
	return count;
    }

}