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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;

/**
 * Magicka
 */
public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Kattio io;

//		io = new Kattio(System.in, System.out);
//		io = new Kattio(new FileInputStream("src/qual2012/B-sample.in"), System.out);
		io = new Kattio(new FileInputStream("src/qual2012/B-small-attempt1.in"), new FileOutputStream("src/qual2012/B-small-1.out"));
//		io = new Kattio(new FileInputStream("src/qual2012/B-large.in"), new FileOutputStream("src/qual2012/B-large.out"));

		int cases = io.getInt();
		for (int i = 1; i <= cases; i++) {
			io.print("Case #" + i + ": ");
			new B().solve(io);
		}
		io.close();
	}

	private void solve(Kattio io) {
		int n = io.getInt(), m = io.getInt(), p = io.getInt();

		boolean[] okNormal = new boolean[31];
		boolean[] okSurprising = new boolean[31];

		for (int i = 0; i <= 10; i++) {
			for (int j = i; j <= 10; j++) {
			    for (int k = j; k <= 10; k++) {
			   		if (k > i+2) continue;
					if (k >= p) {
						if (k > i+1)
							okSurprising[i+j+k] = true;
						else
							okNormal[i+j+k] = true;
					}
			    }
			}
		}

		int cnt = 0;
		for (int i = 0; i < n; i++) {
		    int score = io.getInt();
			if (okNormal[score]) cnt++;
			else if (m > 0 && okSurprising[score]) { cnt++; m--; }
		}
		io.println(cnt);

	}
}
