import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;


public class DancingGooglers {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int i = 1; i <= T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			List<Integer> scores = new ArrayList<Integer>();
			for (int j = 0; j < N; j++)
				scores.add(in.nextInt());
			System.out.println("Case #" + i + ": " + result(S, p, scores));
		}
	}

	private static int result(int S, int p, List<Integer> scores) {
		Integer[] v = scores.toArray(new Integer[0]);
		Arrays.sort(v);
		int res = 0;
		int nosup = p + 2*(Math.max(p-1, 0));
		int sup = p + 2*(Math.max(p-2, 0));
		for (int i = v.length-1; i >= 0; i--)
			if (v[i] >= nosup)
				res++;
			else if (v[i] >= sup && S > 0) {
				res++;
				S--;
			}
			else
				return res;
		return res;
	}
	
}
