/**
 * 
 */
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 fixjava;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.Map.Entry;

public abstract class Filter<T> {

	abstract boolean accept(T item);

	public static <U> ArrayList<U> list(Iterable<U> collection, Filter<U> filter) {
		ArrayList<U> filtered = new ArrayList<U>();
		for (U item : collection)
			if (filter.accept(item))
				filtered.add(item);
		return filtered;
	}

	public static <U> HashSet<U> set(Set<U> set, Filter<U> filter) {
		HashSet<U> filtered = new HashSet<U>();
		for (U item : set)
			if (filter.accept(item))
				filtered.add(item);
		return filtered;
	}

	public static <K, V> HashMap<K, V> mapKeys(Map<K, V> map, Filter<K> keyFilter) {
		HashMap<K, V> filtered = new HashMap<K, V>();
		for (Entry<K, V> ent : map.entrySet())
			if (keyFilter.accept(ent.getKey()))
				filtered.put(ent.getKey(), ent.getValue());
		return filtered;
	}

	public static <K, V> HashMap<K, V> mapValues(Map<K, V> map, Filter<V> valueFilter) {
		HashMap<K, V> filtered = new HashMap<K, V>();
		for (Entry<K, V> ent : map.entrySet())
			if (valueFilter.accept(ent.getValue()))
				filtered.put(ent.getKey(), ent.getValue());
		return filtered;
	}
}
