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

import java.io.FileInputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class B {

	public static void main(String[] args) throws Exception {
		new B().run();
	}

	void run() throws Exception {
		Scanner in = new Scanner(System.in);
		in = new Scanner(new FileInputStream("B-small-attempt0.in"));
		PrintStream out = System.out;
		out = new PrintStream("B-small-attempt0.out");

		int T = in.nextInt();
		for (int x = 1; x <= T; x++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int t[] = new int[N];
			for (int i = 0; i < t.length; i++)
				t[i] = in.nextInt();
			out.printf("Case #%d: %d\n", x, countAtLeastP(t, p, S));
		}

	}

	int countAtLeastP(int[] t, int p, int s) {
		int canN = 0;
		int canS = 0;
		for (int i : t)
			if (canAtLeastPNonSurprising(i, p)) canN++;
			else if (canAtLeastPSurprising(i, p)) canS++;
		return (canN ) + Math.min(canS, s);
	}

	// min total score with best ind score of p is p + (p-1) + (p-1)
	boolean canAtLeastPNonSurprising(int s, int p) {
		return s >= 3 * p - 2;
	}

	// min surp total score with best ind score of p is p + (p-2) + (p-2)
	boolean canAtLeastPSurprising(int s, int p) {
		if (s < 2) return false;
		return s >= 3 * p - 4;
	}

}
