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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			BufferedReader input = new BufferedReader (new InputStreamReader(new FileInputStream("./bin/codeJam2011/B-small-attempt0.in")));
			BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("./bin/B.out")));
			
			int cases = Integer.parseInt(input.readLine());
			for ( int i =0; i < cases ;i++)
			{
				int bestCounter =0;
				String [] line = input.readLine().split(" ");
				int su = Integer.parseInt(line[1]);
				int best = Integer.parseInt(line[2]);
				
				
				for(int n =3; n<line.length; n++)
				{
					
					int score = Integer.parseInt(line[n]);
					if(score >= 3*best-2)
					{
						bestCounter++;
					}
					else if(3*best-4>0 & score >= 3*best-4   & su >0   )
					{
						bestCounter++;
						su --;
					}
					
				}
				output.write("Case #"+(i+1)+": "+bestCounter+"\n");
				System.out.println("Case #"+(i+1)+": "+bestCounter);
				
			}
			output.close();
		} catch (Exception e) {
			e.printStackTrace();
		}

	}

}
