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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class B {

	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-large.out"));
		
		
		int T = new Integer(br.readLine());
		for(int cases =0;cases< T; cases ++)
		{
			String str = br.readLine();
			StringTokenizer st = new StringTokenizer(str);
			int N = new Integer(st.nextToken());
			int S = new Integer(st.nextToken());
			int p =new Integer(st.nextToken());
			
			int count =0;
	
			int[] scores = new int[N];
			for(int i =0;i<N;i++)
				scores[i] = new Integer(st.nextToken());
			for(int j=0;j<N;j++)
			{
				int score = scores[j];
				int l = score - 3*p;
				if(l>=0)
				{
					count++;
				}
				else if(l==-1 || l==-2)
				{
					count++;
				}
				else if((l==-3 || l==-4) && S>0 && score >=3*p-4 && score>p)
				{
					count++;
					S--;
				}
				
			}
			pw.println("Case #" +(cases+1) +": " +count);
		}
		
		pw.close();
		br.close();
		

	}

}
