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

import java.util.Scanner;

public class Qual2012B {
	private final int[] score;
	private int[] countWithSurprise;
	private int[] countWithoutSurprise;

	public Qual2012B(int[] score, int resultAsked) {
		this.score = score;
		this.countWithoutSurprise = new int[31];
		this.countWithSurprise = new int[31];
		initCountArrays(resultAsked);
	}

	protected void initCountArrays(int resultAsked) {
		for (int a = 0; a <= 10; a++)
			for (int b = Math.max(0, a - 2); b <= Math.min(10, a + 2); b++)
				for (int c = Math.max(0, a - 2); c <= Math.min(10, a + 2); c++) {
					int diff = Math
							.max(Math.abs(b - c), Math.max(Math.abs(a - c), Math.abs(a - b)));
					if (diff >= 3)
						continue;
					int count = 0;
					if (a >= resultAsked)
						count++;
					if (b >= resultAsked)
						count++;
					if (c >= resultAsked)
						count++;
					int total = a + b + c;
					if (diff == 2) {
						if (count > countWithSurprise[total])
							countWithSurprise[total] = 1;
					} else {
						if (count > countWithoutSurprise[total])
							countWithoutSurprise[total] = 1;
					}
				}
	}

	public static void main(String[] args) {
		Scanner scanner = new Scanner( System.in);
		int nrOfTestCases = scanner.nextInt();
		for (int caseNr = 1; caseNr <= nrOfTestCases; caseNr++) {
			int googCount = scanner.nextInt();
			int surprises = scanner.nextInt();
			int resultAsked = scanner.nextInt();
			int[] score = new int[googCount];
			for (int i = 0; i < googCount; i++)
				score[i] = scanner.nextInt();
			Qual2012B solver = new Qual2012B(score, resultAsked);
			System.out.println("Case #" + caseNr + ": " + solver.solve(0, surprises));
		}
	}

	private int solve(int index, int surprisesLeft) {
		if (index >= score.length)
			return surprisesLeft == 0 ? 0 : Integer.MIN_VALUE;
		int thisScore = score[index];
		int bestWithoutSurprise = countWithoutSurprise[thisScore] + solve(index + 1, surprisesLeft);
		if (surprisesLeft > 0) {
			int bestWithSurprise = countWithSurprise[thisScore]
					+ solve(index + 1, surprisesLeft - 1);
			return Math.max(bestWithSurprise, bestWithoutSurprise);
		}
		return bestWithoutSurprise;
	}
}
