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.Scanner;


public class Googlers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String st = in.nextLine();
		
		
		int b = Integer.parseInt(st);
		
		for(int a = 0; a< b; a++)
		{
			st = in.nextLine();
			String sp[] = st.split(" ");
			int n = Integer.parseInt(sp[0]);
			int s = Integer.parseInt(sp[1]);
			int p = Integer.parseInt(sp[2]);
			int g[] = new int[n];
			double gd[] = new double[n];
			int c = 0;
			for(int i = 0;i<n;i++)
			{
				g[i] =  Integer.parseInt(sp[i+3]);
				
				if(g[i] >= (p*3)-2)
					c++;
				else if((g[i] >= (p*3)-4) && s > 0 && g[i]!=0)
				{
					c++;
					s--;
				}
//				gd[i] = ((double)g[i])/3;
			}
			
//			java.util.Arrays.sort(gd);
////			java.util.Arrays.sort(g);
//			
//			for(int i = n-1;i>=0;i--)
//			{
//				if((gd[i] > p) || ((double)p - gd[i] < 1))
//				{
//					c++;
//				}
//				else if((s > 0) && (((double)p-gd[i]) <=1.333333333333334) && gd[i] != 0) 
//				{
//					c++;
//					s--;
//				}
//				else
//					break;
//			}
			
			System.out.println("Case #"+(a+1)+": " + c);
		}		
		
	}

}
