/**
 * 
 */
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 jam2012.dancers;

import java.io.File;
import java.io.IOException;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;

import commons.FileUtilities;

public class GoogleDancers {

    public static void main(String[] args) throws IOException {

        List<String> strings = FileUtilities.readFile(new File(
                "B-small-attempt1.in"));

        int number = Integer.parseInt(strings.get(0));

        List<String> result = new LinkedList<String>();

        for (int i = 1; i <= number; i++) {

            Scanner s = new Scanner(strings.get(i));

            int dancers = s.nextInt();
            int surprisingAmount = s.nextInt();
            int atLeast = s.nextInt();

            int[] values = new int[dancers];
            for (int j = 0; j < dancers; j++) {
                values[j] = s.nextInt();
            }
            int[] minvalues = new int[dancers];
            boolean[] cansurprise = new boolean[dancers];
            int tresult = 0;

            // Unsurprising values
            for (int j = 0; j < dancers; j++) {
                int minAmount = values[j] / 3;
                int rest = values[j] - (minAmount * 3);
                if (rest > 0) {
                    minAmount++;
                }
                if (rest != 1 && values[j] > 1 && values[j] < 28) {
                    cansurprise[j] = true;
                }
                minvalues[j] = minAmount;
                if (minAmount >= atLeast) {
                    tresult++;
                }
            }
            for (int j = 0; j < dancers; j++) {
                if (surprisingAmount > 0 && atLeast == minvalues[j] + 1 && cansurprise[j]) {

                    surprisingAmount--;
                    tresult++;
                }
            }
            result.add(Integer.toString(tresult));
        }
        FileUtilities.writeFile(result, new File("B-small-attempt1.out"));
    }
}
