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

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;

import Controller.IO;

public class WiresCase extends CaseSolver {

	private ArrayList<Short[]> lines;
	private int numOfIntersections;

	public WiresCase(int order, int numberOfLines, IO io) {
		super(order, numberOfLines, io);
	}

	@Override
	public void initializeVars() {
		lines = new ArrayList<Short[]>();
	}

	@Override
	public void addLine(String line) {
		String[] tmp = line.split(" ");
		Short[] tmp2 = { Short.parseShort(tmp[0]), Short.parseShort(tmp[1]) };
		this.lines.add(tmp2);
	}

	@Override
	public void printSolution() {
		System.err.println("Case #" + getOrder() + ": " + numOfIntersections);
	}

	@Override
	public CaseSolver process() {
		Collections.sort(lines, new Comparator<Short[]>() {
			@Override
			public int compare(Short[] o1, Short[] o2) {
				return o1[0] - o2[0];
			}
		});
		//printList();


		for (int i = 0; i < lines.size(); i++) {
			for (int j = i + 1; j < lines.size(); j++) {
				if (lines.get(i)[1] > lines.get(j)[1]) {
					numOfIntersections++;
				}
			}
		}

		return this;
	}

	private void printList() {
		for (Short[] a : lines) {
			System.err.println(Arrays.deepToString(a));
		}
	}
}