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.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class ProblemB {
 public static void main(String[] args) throws Exception {
  BufferedReader br = new BufferedReader(new FileReader(new File("B-large.in")));
  PrintWriter pw = new PrintWriter(new File("B-large.out"));
  int n, s,p, count,   temp;
  int t= new Integer(br.readLine());
  for(int c=1; c<=t; c++)
  {
   pw.append("Case #"+c+": ");
   StringTokenizer st = new StringTokenizer(br.readLine());
   n = new Integer(st.nextToken());
   s= new Integer(st.nextToken());
   p = new Integer(st.nextToken());
   count=0;
   if(p==0)
	   count=n;
   else
	for(int i=0; i< n ; i++)
   {
	temp= new Integer(st.nextToken());
	if(temp< p )
		continue;
	
    temp = (temp-p)/2;
    
    if(temp >=p-1)
    	count++;
    else if (temp>=p-2 && s>0 && p>1)
    	{
    		count++;
    		s--;
    	}
   }
   pw.append(count+"");
   pw.append('\n');
  }
  pw.flush();
  pw.close();
  br.close();
 }
}
