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.util.StringTokenizer;


public class B {

  void main2(String[] args) throws Exception {
    BufferedReader br = new BufferedReader(new FileReader(args[0]));
    String line = br.readLine();
    int count = Integer.parseInt(line);
    for (int i = 0; i < count; i++) {
      line = br.readLine();

      // 3 1 5 15 13 11
      StringTokenizer st = new StringTokenizer(line, " ", false);
      int n = Integer.parseInt(st.nextToken());
      int s = Integer.parseInt(st.nextToken());
      int p = Integer.parseInt(st.nextToken());

      int[] t = new int[n];
      for (int j = 0; j < n; j++) {
        t[j] = Integer.parseInt(st.nextToken());
      }

      System.out.println("Case #" + (i + 1) + ": " + max(n, s, p, t));
    }
    br.close();
  }


  private int max(int n, int s, int p, int[] t) {
    int max = 0;

    for (int i = 0; i < n; i++) {

      int r = t[i] % 3;
      int k = t[i] / 3;
      int b = 0;
      int bs = 0;
      switch (r) {
      case 0:
        b = k;
        bs = t[i] == 0 ? 0 : k + 1;
        break;
      case 1:
        b = k + 1;
        bs = t[i] == 1 ? -1 : k + 1;
        break;
      case 2:
        b = k + 1;
        bs = k + 2;
      }

      if (b >= p) {
        max++;
      } else if (bs >= p && s > 0) {
        max++;
        s--;
      }

    }
    return max;
  }



  public static void main(String[] args) throws Exception {
    new B().main2(args);
  }
}
