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

public class b {

	public static void main(String[] args) throws IOException
	{
		Scanner qwe = new Scanner(new File("b.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("b.out"));
		int t = qwe.nextInt();
		for(int i = 1; i <= t; i++)
		{
			int n = qwe.nextInt();
			int s = qwe.nextInt();
			int p = qwe.nextInt();
			
			int[] totals = new int [n];
			for(int j= 0; j < n; j++)
			{
				totals[j] = qwe.nextInt();
			}
			
			Arrays.sort(totals);
			
			int count = 0;
			for(int j = n-1; j >= 0; j--)
			{
				if(p == 0)
					count++;
				else if(totals[j] == 0)
					break;
				else if(p + 2*(p-1) <= totals[j])
					count++;
				else if(s > 0 && p >=2 && p + 2*(p-2) <= totals[j] )
				{
					count ++; 
					s --;
				}
				else
					break;
			}
			
			out.write("Case #" + i + ": " + count +  "\n");
		}
		out.close();
	}
}

