/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

package exercise;

public class Solver {
	private static int	VOTES_NB = 3;
	private static int	VARIABLES_NB = 3;
	
	public static Integer[]	solve(Integer[][] input) {
		Integer[]	result = new Integer[input.length];
		
		for (int cnt = 0; cnt < input.length; ++cnt)
			result[cnt] = solve(input[cnt]);
		
		return result;
	}

	public static int	solve(Integer[] input) {
		if (input == null || input.length < 3)
			return 0;
		
		int	googlersNb = input[0];
		int	surprisingTriplets = input[1];
		int	target = input[2];
		
		if (input.length < VARIABLES_NB + googlersNb)
			return 0;
		
		int	result = 0;
		
		Integer[]	candidates = new Integer[surprisingTriplets]; 
		for (int cnt = VARIABLES_NB; cnt < input.length; ++cnt) {
			if (input[cnt] < target * VOTES_NB - (VOTES_NB - 1)) {
				int	minIndex = 0;
				int	min = -1;
				for (int tmp = 0; tmp < candidates.length; ++tmp) {
					if (candidates[tmp] == null || input[cnt] > candidates[tmp]) {
						if (candidates[tmp] == null || min == -1 || candidates[tmp] < min) {
							min = (candidates[tmp] == null) ? 0 : candidates[tmp];
							minIndex = tmp;
						}
					}
				}
				if (min >= 0 && input[cnt] >= min)
					candidates[minIndex] = input[cnt];
			} else
				++result;
		}
		
		if (candidates.length > 0) {
			int	surprisingTarget = target + target - 2 + target - 2;
			if (surprisingTarget <= 0)
				surprisingTarget = target;
			if (candidates != null)
				for (int cnt = 0; cnt < candidates.length; ++cnt)
					if (candidates[cnt] != null && candidates[cnt] >= surprisingTarget)
						result++;
		}
		
		return result;
	}
}
