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.util.*;
import java.io.*;

public class B  {
	public static void main (String [] args) {
		try {
			BufferedReader br = new BufferedReader(new FileReader("B-large-0.in"));
			PrintWriter pw = new PrintWriter("B-large-0.out");
			int inputNo;
			inputNo = Integer.parseInt(br.readLine());

			for (int i = 1; i <= inputNo; i++) {
				// get one input here
				String in = br.readLine();
				pw.println("Case #" + i + ": " + processInput(in));
			}

			br.close();
			pw.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	public static int processInput(String in) {
		int result = 0;

		Scanner sc = new Scanner(in);
		int gNo = Integer.parseInt(sc.next());
		int sup = Integer.parseInt(sc.next());
		int max = Integer.parseInt(sc.next());
		int supNo = 0;
		int goodNo = 0;

		for (int i = 0; i < gNo; i++) {
			int total = Integer.parseInt(sc.next());
			int can = canMax(max, total);
			if (can == 1) supNo++;
			if (can == 0) goodNo++;
		}

		if (supNo > sup) result = goodNo + sup;
		else result = goodNo + supNo;

		return result;
	}

	public static int canMax(int max, int total) {
		int av = total/3;
		int r = total%3;
		if (r == 0) {
			if (av >= max) return 0;
			if (av+1 >= max && av+1 <= 10 && av-1 >= 0) return 1;
			return -1;
		}
		if (r == 1) {
			if (av+1 >= max && av + 1 <= 10) return 0;
			return -1;
		}
		if (r == 2) {
			if (av+1 >= max && av+1 <= 10) return 0;
			if (av+2 >=max && av+2 <= 10) return 1;
			return -1;
		}

		return -1;
	}
}
