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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.io.FileWriter;

public class DancingWithTheGooglers {
  public static void main(String... args) {

    try {
      File f = new File("B-large.in");
      File outFile = new File("output.txt");
      FileWriter w = new FileWriter(outFile);
      Scanner s = new Scanner(f);
      int T = s.nextInt();
      s.nextLine();
      for(int i = 1; i<= T; i++) {
        int N = s.nextInt();
        int S = s.nextInt();
        int p = s.nextInt();
        int[] t = new int[N];
        for(int j = 0; j < N; j++) {
          t[j] = s.nextInt();
        }
        int max = findMax(N,S,p,t);
        String line = "Case #" + i +": " + max + '\n';
        System.out.print(line);
        w.write(line);
        if(s.hasNextLine()) s.nextLine();
      }
      w.close();
    }
    catch(Exception e) { }
  }
  private static int findMax(int N, int S, int p, int[] t) {
    int possible = 0;
    int surprising = 0;
    for(int i = 0; i < t.length; i++) {
      if(p == 1) {
        if(t[i] >= 1) {
          possible++;
        }
      }
      else if(t[i] >= (3*p - 2)){
        possible++;
      }
      else if(t[i] >= (3*p - 4)) {
        surprising++;
      }
    }
    return possible + Math.min(surprising, S);
  }
}