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;
    }
}


package problemB;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;



public class DancingwithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
		FileWriter fw = new FileWriter("B-large.out");
		/*BufferedReader in = new BufferedReader(new FileReader("A-large-practice.in"));
		FileWriter fw = new FileWriter("A-large-practice.out");*/
		int T = new Integer(in.readLine());
		for (int cases = 1; cases <= T; cases++){
			StringTokenizer st=new StringTokenizer(in.readLine());
			int numG = new Integer(st.nextToken());
			int numTriplets = new Integer(st.nextToken());
			int leastP = new Integer(st.nextToken());
			Integer[] A = new Integer[numG];
			for (int i = 0; i < A.length; i++){
				A[i] = new Integer(st.nextToken());
			}
			Arrays.sort(A, Collections.reverseOrder());
			int result = 0;
			for (int i = 0; i < A.length; i++){
				if (A[i] >= 2){
					if (A[i] > (leastP * 3 - 3)){
						result++;
					}
					else{
						if ((A[i] > (leastP *3 - 5)) && numTriplets > 0){
							result++;
							numTriplets--;
						}
					}
				}
				else{
					if (A[i] >= leastP){
						result++;
					}
				}
			}
			
			if (cases != T) {fw.write("Case #" + cases + ": "+ result + "\n"); }
			else{fw.write("Case #" + cases + ": "+ result);}
		}
		fw.flush();
		fw.close();
	}
}
