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

public class RQQ2 {
	
	public static void main(String[] args)
	{
		try
		{
			HashMap<Character,Character> map = new HashMap<Character,Character>();
			Scanner s = new Scanner(new File("B-large.in"));
			FileWriter o = new FileWriter(new File("out.txt"));
			
			Integer lines = Integer.parseInt(s.nextLine());
			String str;
			Integer sup;
			Integer googlers;
			Integer p;
			StringTokenizer st;
			
			for (int i = 0; i < lines; i++)
			{
				o.write("Case #" + ( i + 1) + ": ");
				str = s.nextLine();
				st = new StringTokenizer(str, " ");
				googlers = Integer.parseInt(st.nextToken());
				sup = Integer.parseInt(st.nextToken());
				p = Integer.parseInt(st.nextToken());
				int even = 0;
				int max = 0;
				
				for (int j = 0; j < googlers; j++)
				{
					int total = Integer.parseInt(st.nextToken());
					if ( Math.ceil((double)total / 3.0) >= p )
					{
						max++;
					}
					else if ( total != 0 && Math.ceil((double)total/3.0 + 2.0/3.0) >= p)
					{
						even++;
					}
				}
				max += Math.min(even, sup);
				o.write("" + max + "\n");
			}
			
			s.close();
			o.close();
			
		}
		catch(Exception e)
		{
			System.out.println(e.getMessage());
			e.printStackTrace(System.out);
		}
	}
}
