/*
 * 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 com.self.code.jam.twelve;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.Reader;

public class DancingScores {

	public static void main(String[] argv)
	{
		try
		{
			long startTime = System.currentTimeMillis();
			Reader reader = new FileReader("D:\\workspace\\Learn\\src\\com\\self\\code\\jam\\twelve\\input\\dancing\\B-small-attempt0.in");
			BufferedReader bufReader = new BufferedReader(reader);
			String x = bufReader.readLine();
			int count = 0;

			File file = new File("D:\\workspace\\Learn\\src\\com\\self\\code\\jam\\twelve\\output\\dancing\\B-small-attempt0.out");
			FileWriter writer = new FileWriter(file);
			
			while((x = bufReader.readLine()) != null)
			{
				count++;
				String res = DancingScores.getMaxBestResult(x);
				if (count == 1)
					writer.write("Case #"+count+": " + res);
				else
					writer.write("\nCase #"+count+": " + res);
			}
			writer.close();
			System.out.println("Total time = " +( System.currentTimeMillis() - startTime));
		}
		catch (Exception e) {
			e.printStackTrace();
		}
	}

	private static String getMaxBestResult(String input) {
		String[] numbers = input.split(" ");
		if(numbers.length <= 3)
			return "0";
		int N = Integer.parseInt(numbers[0]);
		int S = Integer.parseInt(numbers[1]);
		int P = Integer.parseInt(numbers[2]);

		int maxBestResult = 0;
		
		for (int i=3; i<(3+N); i++)
		{
			int number = Integer.parseInt(numbers[i]);
			int division = number/3 ;
			int remainder = number % 3;
			
			if (remainder == 0)
			{
				if (division >= P)
				{
					maxBestResult ++;
				}
				else if ((S != 0) && ((division + 1) >= P) && (division !=0))
				{
					S--;
					maxBestResult ++;
				}
			}
			else if (remainder == 1)
			{
				if ((division + 1) >= P)
				{
					maxBestResult ++;
				}
				// it can not be a Surprising case
			}
			else if (remainder == 2)
			{
				if ((division + 1) >= P)
				{
					maxBestResult ++;
				}
				else if ((S != 0) && ((division + 2) >= P))
				{
					S--;
					maxBestResult ++;
				}
			}
		}
		return String.valueOf(maxBestResult);
	}
}
