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.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingGooglers
{
  public static void main(String[] args)
  {
    try
    {
      BufferedReader reader = new BufferedReader(new FileReader(args[0]));
      FileWriter fileWriter = new FileWriter(args[1]);

      String casesNo = reader.readLine();

      for (int t = 0; t < Integer.parseInt(casesNo); t++)
      {
        String[] params = reader.readLine().split(" ");

        int y = 0;
        int s = Integer.parseInt(params[1]);
        int p = Integer.parseInt(params[2]);

        int normalLimit = (3 * p) - 2;
        int suprisingLimit = normalLimit - 2;

        for (int n = 0; n < Integer.parseInt(params[0]); n++)
        {
          int ti = Integer.parseInt(params[n + 3]);

          if (ti >= normalLimit)
            y++;
          else if (suprisingLimit>0 && s>0 && ti >= suprisingLimit)
          {
            y++;
            s--;
          }


//          int pi = ti%3 > 0 ? (ti/3)+1 : ti/3;
//
//          if (pi >= p)
//            y++;
//          else if (ti > 1 && ti < 29 && s > 0 && pi + 1 == p)
//          {
//            y++;
//            s--;
//          }
        }
        fileWriter.write("Case #" + (t + 1) + ": " + Integer.toString(y) + "\n");
      }

      fileWriter.flush();
      fileWriter.close();
    }
    catch (IOException e)
    {
      e.printStackTrace();
    }
  }
}
