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 de.hg.codejam.tasks.dance.service;

import de.hg.codejam.tasks.dance.domain.Case;

public abstract class Calculator {

	public static int[] calculate(Case[] cases) {
		int[] results = new int[cases.length];

		for (int i = 0; i < cases.length; i++)
			results[i] = calculate(cases[i]);

		return results;
	}

	public static int calculate(Case c) {
		int result = 0;

		short upperBorder = calculateUpperBorder(c.getBestResult());
		short lowerBorder = calculateLowerBorder(c.getBestResult());

		int numberOfSurprisingTriplets = c.getNumberOfSurprisingTriplets();

		for (byte points : c.getTotalPoints()) {
			if (points >= upperBorder)
				result++;
			else if (points >= lowerBorder && numberOfSurprisingTriplets > 0) {
				result++;
				numberOfSurprisingTriplets--;
			}
		}

		return result;
	}

	private static short calculateUpperBorder(short bestResult) {
		if (bestResult < 1)
			return bestResult;

		return (short) (bestResult + 2 * (bestResult - 1));
	}

	private static short calculateLowerBorder(short bestResult) {
		if (bestResult < 2)
			return bestResult;

		return (short) (bestResult + 2 * (bestResult - 2));
	}

}
