/*
 * 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 codejam2012Qualification;
import java.io.*;
import java.util.*;
public class B {
	public static void main(String[] args)throws IOException {
		boolean large = false;
		//large = true;
		String dir = "C://Users//Aayush//Desktop//";
		String InputFile = dir + (large ? "B-large.in" : "B-small-attempt0.in");
		String OutputFile = dir + (large ? "B-large.out" : "B-small.out");
		File file = new File(InputFile);
		Scanner st = new Scanner(file);
		FileWriter fw = new FileWriter(OutputFile);
		int T = st.nextInt();
		for(int cases = 1; cases <= T; cases++){
			int N = st.nextInt();
			int S = st.nextInt();
			int p = st.nextInt();
			int[] t = new int[N];
			for(int i = 0; i < N; i++){
				t[i] = st.nextInt();
			}
			int count = 0;
			for(int i = 0; i < N; i++){
				//a, b and are the scores allotted to googler a <= b <= c
				int a = t[i] / 3;
				int b = t[i] / 3;
				int c = t[i] / 3;
				if(t[i] % 3 == 0){
					if(c >= p)count++;
					else if(b > 0 && c == p - 1 && S > 0){
						S--;
						count++;
					}
				}else if(t[i] % 3 == 1){
					c += 1;
					if(c >= p)count++;
				}else if(t[i] % 3 == 2){
					c += 1;
					b += 1;
					if(c >= p)count++;
					else if(b > 0 && c == p - 1 && S > 0){
						S--;
						count++;
					}
				}
			}
			System.out.print("Case #" + cases + ": " + count);
			fw.write("Case #" + cases + ": " + count);

			System.out.println();
			fw.write("\n");

		}
		fw.flush();
		fw.close();

	}
}
