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


/**
 * Copyright 2012 Christopher Schmitz. All Rights Reserved.
 */

package com.isotopeent.codejam.lib;

public abstract class SolverBase<T> {

	private InputReader<T> inputReader;
	protected int[] params;

	public SolverBase(int initParamCount) {
		if (initParamCount > 0) {
			params = new int[initParamCount];
		}
	}

	public void init(InputReader<T> inputReader) {
		this.inputReader = inputReader;

		if (params != null) {
			try {
				String line = inputReader.readLine();
				params = Utils.convertToIntArray(line, params.length);
			} catch (Exception e) {
				System.err.println("Error while reading initial parameters");
				e.printStackTrace();
			}
		}
	}

	public final String solveNext() {
		String solution = null;
		T input = inputReader.readInput();
		if (input != null) {
			solution = solve(input);
		}
		return solution;
	}

	protected abstract String solve(T input);

}
