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);
	}

}

package qr;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class B {
  public static void main(String[] args) throws FileNotFoundException {
    Scanner scanner = new Scanner(new File("B-large.in"));
    int tcn = scanner.nextInt();
    int tc = 1;
    while (tc <= tcn) {
      int n = scanner.nextInt();
      int s = scanner.nextInt();
      int p = scanner.nextInt();
      // int[] base = new int[n];
      int y = 0;

      for (int i = 0; i < n; i++) {
        int t = scanner.nextInt();
        int base = t / 3;
        int mmm = t % 3;
        if (mmm != 0) {
          base++;
        }

        if (base >= p) {
          if (mmm == 0 && t >= 0)
            y++;
          if (mmm == 1 && t >= 1)
            y++;
          if (mmm == 2 && t >= 2)
            y++;
        } else if (s > 0) {
          if (base + 1 == p) {
            if (mmm == 0 && t >= 3) {
              y++;
              s--;
            }
//            if (mmm == 1 && t >= 4) {
//              y+=0;
//              s--;
//            }
            if (mmm == 2 && t >= 2) {
              y++;
              s--;
            }

          }
        }
      }
      System.out.printf("Case #%d: %d\n", tc, y);

      // base >= p -> ok
      // base -1 -> can be ok

      tc++;
    }

  }
}
