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 google.codejam.dancingwithgooglers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;


public class Main {

	public static void main(String[] args) throws Exception {
		String[] files = {
				"Data/B-large"
				};


		for (int f = 0; f < files.length; f++) {
			BufferedReader in = new BufferedReader(new FileReader(files[f] + ".in"));
			BufferedWriter out = new BufferedWriter(new FileWriter(files[f] + ".out"));

			int T = Integer.parseInt(in.readLine()); // number of test cases

			for (int i = 1; i <= T; i++) {
				String[] input = in.readLine().split(" ");
				int googlers = Integer.parseInt(input[0]);
				int suprizing = Integer.parseInt(input[1]);
				int p = Integer.parseInt(input[2]);
				int [] t = new int[googlers];
				
				for (int j = 0; j < input.length - 3; j++)
					t[j] = Integer.parseInt(input[j+3]);
				
				int m = getBest(googlers, suprizing, p, t); 
				
			
				out.write(String.format("Case #%d: %d\n", i, m));
			}

			out.close();
			in.close();

		}
		
	}

	private static int getBest(int N, int S, int p, int[] t) {
		int output = 0;

		
		for (int i = 0; i < t.length; i++) {

			if (t[i] >= (3*p - 2) && t[i] > 0 || p == 0) output++;
			else if (t[i] >= (3*p - 4) && t[i] > 0 && S > 0)
			{
				S--;
				output++;
			}
		
		}
		
		return output;

	}

}
