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 com.spelchec.codejam.project2;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Main {
	public static void main (String[] args) throws IOException {
		final String outputTemplate = "Case #%d: %d\n";		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int run = Integer.parseInt(br.readLine());
		for (int r = 1; r <= run; r++) {
			Scanner scan = new Scanner(br.readLine());
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int[] results = new int[N];
			for (int i = 0; i < N; i++) {				
				results[i] = scan.nextInt();
			}
			System.out.print(String.format(outputTemplate, r, solve(N, S, p, results)));
		}
	}

	private static int solve(int N, int S, int p, int[] results) {
		int count = 0;
		
		for (int i = 0; i < results.length; i++) {
			int r = results[i];
			int threshold = p*3-2;
			if (r >= threshold) {
				count++;
			} else if (S > 0 && r >= threshold - 2 && r >= 2) {
				count++; S--;
			}
		}
				
		return count;
	}
}
 