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

public class Dancing {

	/**
	 * 
	 * @param N
	 *            Number of Googlers
	 * @param S
	 *            number of surprising triplets of scores
	 * @param P
	 * 
	 * @param Ti
	 *            the total points of the Googlers
	 * 
	 * @return what is the maximum number of Googlers that could have had a best
	 *         result of at least p
	 */
	public static int howMany(int N, int S, int P, int[] Ti) {

		if (0 == P)
			return N;

		int count = 0;
		int specials = 0;

		for (int t : Ti) {

			if (0 == t)
				continue;
			
			int mod = t % 3;
			int div = t / 3;

			int max = -1;
			int maxSpecial = -1;

			switch (mod) {

			case 0:
				max = div;
				maxSpecial = div + 1;
				break;

			case 1:
				max = div + 1; // same as 'maxSpecial'
				break;

			case 2:
				max = div + 1;
				maxSpecial = div + 2;
				break;
			}

			if (max >= P)
				count++;

			else if (maxSpecial >= P)
				specials++;
		}

		if (specials > S)
			count += S;

		else
			count += specials;

		return count;
	}
}
