package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

package com.google.dancing;

import java.util.Scanner;

import com.google.util.FileUtil;

/*
 *
 *
 */
public class Dancing {

	public static void main(String[] args) {
		String orgFilePath = "E:\\Google_Jam\\Dancing\\B-large.in";
		Scanner scanner = FileUtil.openFile(orgFilePath);
		StringBuilder sb = new StringBuilder();

		int caseNum = Integer.valueOf(scanner.nextLine());
		for (int i = 0; i < caseNum; i++) {
			sb.append("Case #" + (i + 1) + ": ");
			String line = scanner.nextLine();
			String[] numbers = line.split(" ");
			// String[] numbers = {"15"};
			int n = 0;// ´ïµ½×î´óÖµµÄ¸öÊý
			int googlers = Integer.valueOf(numbers[0]);// Ñ¡ÊÖ¸öÊý
			int suprising = Integer.valueOf(numbers[1]);// µÃ·Ö²î´óÓÚ2
			int max = Integer.valueOf(numbers[2]);// ÆÚÍûÖµ
			/*
			 * int googlers = 1; int suprising =1; int max = 3;
			 */
			for (int j = 0; j < googlers; j++) {
				int temp = Integer.valueOf(numbers[j + 3]);// µ±Ç°Ñ¡ÊÖËùµÃ×Ü·Ö
				// int temp = Integer.valueOf(numbers[0]);
				if (temp / 3 >= max) {
					n++;
				} else if ((max - (temp / 3) == 1)
						&& ((temp / 3) + (temp % 3)) >= max) {
					n++;
				} else if ((max - (temp / 3)) > 1
						&& ((temp / 3) + (temp % 3)) >= max && suprising > 0) {
					n++;
					suprising--;
				} else if (temp != 0 && max - temp / 3 == 1 && suprising > 0
						&& temp % 3 == 0) {
					n++;
					suprising--;
				}
			}
			sb.append(n);
			sb.append("\n");
		}
		FileUtil.writeFile(sb, "Dancing\\large.in");
	}
}
