/*
 * 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 de.hg.codejam.tasks.dance.service;

import de.hg.codejam.tasks.dance.domain.Case;

public abstract class Calculator {

	public static int[] calculate(Case[] cases) {
		int[] results = new int[cases.length];

		for (int i = 0; i < cases.length; i++)
			results[i] = calculate(cases[i]);

		return results;
	}

	public static int calculate(Case c) {
		int result = 0;

		short upperBorder = calculateUpperBorder(c.getBestResult());
		short lowerBorder = calculateLowerBorder(c.getBestResult());

		int numberOfSurprisingTriplets = c.getNumberOfSurprisingTriplets();

		for (byte points : c.getTotalPoints()) {
			if (points >= upperBorder)
				result++;
			else if (points >= lowerBorder && numberOfSurprisingTriplets > 0) {
				result++;
				numberOfSurprisingTriplets--;
			}
		}

		return result;
	}

	private static short calculateUpperBorder(short bestResult) {
		if (bestResult < 1)
			return bestResult;

		return (short) (bestResult + 2 * (bestResult - 1));
	}

	private static short calculateLowerBorder(short bestResult) {
		if (bestResult < 2)
			return bestResult;

		return (short) (bestResult + 2 * (bestResult - 2));
	}

}
