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 q2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		File file = new File("C:/Users/Raja/workspace/GCJ/src/in.txt");
		
		
		int N,S,p;
		int[] sums;
		int norm,surp,ans;
		
		try{
			Scanner s = new Scanner(file);
			int num = Integer.parseInt(s.nextLine());
			for (int i = 0;i<num;i++){
				norm = 0;
				surp = 0;
				N = s.nextInt();
				S = s.nextInt();
				p = s.nextInt();
				sums = new int[N];
				for (int j = 0; j < N; j++){
					sums[j] = s.nextInt();
				}
				Arrays.sort(sums);
				for (int j = 0; j < N; j++){
					if (sums[j] >= 3*p-2)
						norm++;
					else if (sums[j] >= 3*p-4 && sums[j] > 1)
						surp++;
				}
				if (surp > S)
					ans = norm + S;
				else
					ans = norm + surp;
				
				System.out.println("Case #"+(i+1)+": "+ans);
			}
		}
		catch (FileNotFoundException e){
			e.printStackTrace();
		}

	}

}
