package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

package CaseSolvers;

import Controller.IO;

public class GooglereseCase extends CaseSolver {

	static Character[] opa;
	static {
		opa = new Character[26];
		opa['a' - 97] = 'y';
		opa['b' - 97] = 'h';
		opa['c' - 97] = 'e';
		opa['d' - 97] = 's';
		opa['e' - 97] = 'o';
		opa['f' - 97] = 'c';
		opa['g' - 97] = 'v';
		opa['h' - 97] = 'x';
		opa['i' - 97] = 'd';
		opa['j' - 97] = 'u';
		opa['k' - 97] = 'i';
		opa['l' - 97] = 'g';
		opa['m' - 97] = 'l';
		opa['n' - 97] = 'b';
		opa['o' - 97] = 'k';
		opa['p' - 97] = 'r';
		opa['q' - 97] = 'z';
		opa['r' - 97] = 't';
		opa['s' - 97] = 'n';
		opa['t' - 97] = 'w';
		opa['u' - 97] = 'j';
		opa['v' - 97] = 'p';
		opa['w' - 97] = 'f';
		opa['x' - 97] = 'm';
		opa['y' - 97] = 'a';
		opa['z' - 97] = 'q';
	}

	StringBuilder line;

	public GooglereseCase(int order, int numberOfLines, IO io) {
		super(order, numberOfLines, io);
	}

	@Override
	public void addLine(String line) {
		this.line = new StringBuilder(line);
	}

	@Override
	public void printSolution() {
		System.err.println("Case #" + getOrder() + ": " + line);
	}

	@Override
	public CaseSolver process() {
		for (int i = 0; i < line.length(); i++) {
			char temp = line.charAt(i);
			if (temp != ' ')
				line.setCharAt(i, opa[temp - 97]);
		}
		return this;
	}

	@Override
	public void initializeVars() {
		// TODO Auto-generated method stub

	}

}
