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.util.*;
import java.io.*;

public class Dancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int cases = in.nextInt();

		for (int i = 1; i<=cases; i++) {
			int n = in.nextInt(); // number of googlers
			int s = in.nextInt(); // number of surprising triplets
			int p = in.nextInt(); // ??
			
			int[] points = new int[n];
			for (int j = 0; j<n; j++)
				points[j] = in.nextInt();

			// lowest possible unsurprising triplet:
			// p, p-1, p-1

			// lowest possible surprising triplet:
			// p, p-2, p-2

			int answer = 0;
			int possible = 0;
			int lowUn = lowestUnsurprising(p);
			int lowSu = lowestSurprising(p);
			for (int j = 0; j<n; j++) {
				if (points[j] >= lowUn) answer++;
				else if (points[j] >= lowSu) possible++;
			}

			answer += Math.min(possible, s);
			System.out.println("Case #"+i+": "+answer);
		}
	}

	public static int lowestUnsurprising(int p) {
		return p + (Math.max(p-1, 0))*2;
	}

	public static int lowestSurprising(int p) {
		return p + (Math.max(p-2, 0))*2;
	}
}
