/**
 * 
 */
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 codejam2.dancing;

import java.util.Scanner;

import codejam2.CodejamCase;
import codejam2.CodejamRunner;

public class Dancing extends CodejamRunner implements CodejamCase {

	private int nGooglers;
	private int surprising;
	private int pointMin;
	private int[] points;
	private String result;
	@Override
	public void compute() {
		int ns = 0;
		int s = 0;
		
		for(int i = 0; i < nGooglers; i++) {
			if(points[i] >= 3*pointMin-2)
				ns++;
			else if(pointMin>1 && points[i] >= 3*pointMin-4)
				s++;
		}
		result = String.valueOf(ns + Math.min(s, surprising));

	}

	@Override
	public String getOutput() {
		return result;
	}

	@Override
	public CodejamCase parseCase(Scanner s) {
		Dancing d = new Dancing();
		d.nGooglers = s.nextInt();
		d.surprising = s.nextInt();
		d.pointMin = s.nextInt();
		d.points = new int[d.nGooglers];
		for(int i = 0; i < d.nGooglers; i++)
			d.points[i] = s.nextInt();
		return d;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new Dancing().run(args);
	}

}
