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

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		new B();
	}
	
	int[] notSurprising;
	int[] surprising;
	
	public B()
	{
		notSurprising = new int[31];
		surprising = new int[31];
		
		for(int i = 2; i <= 30; ++i)
		{
			notSurprising[i] = i / 3 + (i % 3 == 0 ? 0 : 1);
			surprising[i] = i / 3 + (i % 3 == 2 ? 2 : 1);
		}
		
		Scanner sc = new Scanner(System.in);
		
		int testCases = sc.nextInt();
		
		for(int testCase = 1; testCase <= testCases; ++testCase)
		{
			int N = sc.nextInt();
			int S = sc.nextInt();
			
			int p = sc.nextInt();
			
			int result = 0;
			
			for(int googler = 0; googler < N; ++googler)
			{
				int score = sc.nextInt();

				if(notSurprising[score] >= p)
				{
					result++;
				}
				else if(S > 0 && surprising[score] >= p)
				{
					result++;
					S--;
				}
			}
			
			System.out.printf("Case #%d: %d\n", testCase, result);
		}
	}
}
