package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

public class Solution {
	static int getGroup(int t, int p) {
		if (t >= 2) {
			if ((t + 1) / 3 + 1 < p) return 0;
			if ((t + 2) / 3 < p) return 1;
			return 2;
		} else if ((t + 2) / 3 >= p) return 3;
		return 4;
	}
	
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("B-large.in"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		int T = in.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			out.print("Case #" + tc + ": ");
			int n = in.nextInt(), s = in.nextInt(), p = in.nextInt();
			int cnt[] = new int[5];
			for (int i = 0; i < n; i++) {
				int t = in.nextInt();
				cnt[getGroup(t, p)]++;
			}
			int ans = cnt[3] + cnt[2] + Math.min(cnt[1], s);
			out.println(ans);
		}
		out.close();
	}

}
