import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

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

}
