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 qualificationRound;

import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileOutputStream;
import java.util.Scanner;


public class B {

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);

		int ncases = sc.nextInt();

		StringBuilder sb = new StringBuilder();
		for ( int ncase = 1; ncase <= ncases; ncase++ ) {
			int nGooglers = sc.nextInt();
			int nSuprising = sc.nextInt();
			int p = sc.nextInt();
			int surprises = 0;
			int count = 0;
			for (int i = 0; i < nGooglers; i++) {
				int s = sc.nextInt();
				int q = s/3;
				int rm = s%3;
				int pq = p-q;
				
				if ( s < p)
					continue;

				if ( q >= p  ) {
					count++;
				}
				else if ( pq <= 2 ){
					if ( rm == 0 ) {
						if ( pq == 1 && surprises < nSuprising ) {
							count++;
							surprises++;
						}
					}
					else {
						if ( pq == 1 )
							count++;
						else if ( rm == 2 && surprises < nSuprising ) {
							count++;
							surprises++;
						}
					}
				}
			}

			sb.append("Case #"+ ncase +": " + count +  "\n");
		}

		BufferedOutputStream bos = null;
		bos= new BufferedOutputStream(new FileOutputStream(new File("C:\\Users\\Christian\\workspaceCPDI\\CodeJam2012\\src\\qualificationRound\\res.txt")));
		bos.write(sb.toString().getBytes());
		bos.close();
	}
	
}