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

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

import reusable.CodeJamBase;

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		new CodeJamBase("B-small-attempt0") {

			@Override
			protected String solution() {
				int[] input = nextIntArray();

				int googlers = input[0];
				int suprisingTriplets = input[1];
				int minBestResult = input[2];

				int minTotal = Math.max(0, 3 * minBestResult - 2); // (a-1)+(a-1)+a
				int minTotalSuprising = Math.max(2, 3 * minBestResult - 4); // (a-2)+(a-2)+a

				int result = 0;

				List<Integer> googlerScores = new ArrayList<>();
				for (int i = 3; i < googlers + 3; i++) {
					googlerScores.add(input[i]);
				}
				Collections.sort(googlerScores, Collections.reverseOrder());

				for (int googlerScore : googlerScores) {
					if (googlerScore >= minTotal) {
						result++;
					} else if ((suprisingTriplets > 0) && (googlerScore >= minTotalSuprising)) {
						suprisingTriplets--;
						result++;
					} else {
						break;
					}
				}

				return String.valueOf(result);
			}

		}.run();
	}
}
