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.*;
import java.util.*;
public class Main{
    public static void main (String[] args) throws java.lang.Exception{
      BufferedReader bfr=new BufferedReader(new InputStreamReader(System.in));
      int T=Integer.parseInt(bfr.readLine());
      int res[]=new int[T];
      Arrays.fill(res,0);
      for(int i=0;i<T;i++){
          String t[]=bfr.readLine().split(" ");
          int N=Integer.parseInt(t[0]);
          int S=Integer.parseInt(t[1]);
          int p=Integer.parseInt(t[2]);
          int x=3*p-4;
          for(int j=3;j<t.length;j++){
              int q=Integer.parseInt(t[j]);
              if(p==1){
                  if(q>0){
                    res[i]++;
                  }
                  continue;
              }
              if(q>x+1){
                  res[i]++;
              }
              else if(q>=x && S>0){
                  res[i]++;
                  S--;
              }
          }
      }
      for(int i=0;i<T;i++){
          System.out.println("Case #"+(i+1)+": "+res[i]);
      }

     
    }
}