/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

package google.codejam.dancingwithgooglers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;


public class Main {

	public static void main(String[] args) throws Exception {
		String[] files = {
				"Data/B-small-attempt1"
				};


		for (int f = 0; f < files.length; f++) {
			BufferedReader in = new BufferedReader(new FileReader(files[f] + ".in"));
			BufferedWriter out = new BufferedWriter(new FileWriter(files[f] + ".out"));

			int T = Integer.parseInt(in.readLine()); // number of test cases

			for (int i = 1; i <= T; i++) {
				String[] input = in.readLine().split(" ");
				int googlers = Integer.parseInt(input[0]);
				int suprizing = Integer.parseInt(input[1]);
				int p = Integer.parseInt(input[2]);
				int [] t = new int[googlers];
				
				for (int j = 0; j < input.length - 3; j++)
					t[j] = Integer.parseInt(input[j+3]);
				
				int m = getBest(googlers, suprizing, p, t); 
				
			
				out.write(String.format("Case #%d: %d\n", i, m));
			}

			out.close();
			in.close();

		}
		
	}

	private static int getBest(int N, int S, int p, int[] t) {
		int output = 0;

		System.out.println(String.format("%d %d %d", N, S, p));
		
		for (int i = 0; i < t.length; i++) {
			System.out.println(String.format("%d", t[i]));

			if (t[i] >= (3*p - 2) && t[i] > 0 || p == 0) output++;
			else if (t[i] >= (3*p - 4) && t[i] > 0 && S > 0)
			{
				System.out.println(String.format("%d %d", t[i], (3*p - 4) ));
				System.out.println("surprise");
				S--;
				output++;
			}
		
		}
		
		return output;

	}

}
