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


public class GCJ2012QualB{
  public  static void main(String args[]){
    
    Scanner s = new Scanner(System.in);
    int t = s.nextInt();
    
    for(int mon=1;mon<=t; mon++){
      
      int nplayer=s.nextInt();
      int nsuprise=s.nextInt();
      int nscore=s.nextInt();
      int ans=0;
      int scores[];
      scores = new int [nplayer];
      for (int i=0; i<nplayer; i++){
        scores[i]=s.nextInt();
      } 
      // java.util.Arrays.sort(scores);
      int limsup=nscore-2;
      if(limsup<0){
        limsup=0;
      }
      int limsupall=nscore+limsup+limsup;
      int limnormal=nscore-1;
      if(limnormal<0){
        limnormal=0;
      }
      int limnormalall=nscore+limnormal+limnormal;
      for (int i=0; i<nplayer; i++){
        int checkscore=scores[i];
        if(checkscore>=limnormalall){
          ans+=1;
        }
        else if(checkscore>=limsupall){
          if (nsuprise>0){
            ans+=1;
            nsuprise-=1;
          }
        }
      }
      
      
      System.out.println("Case #"+ mon+": "+ans);
      
    }
    
  }
}
