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 dg.gcj.bdancing;

import java.util.*;

/**
 * Created by IntelliJ IDEA.
 * User: Dmitry
 * Date: 14.04.12
 * Time: 23:50
 * To change this template use File | Settings | File Templates.
 */
public class PossibleCombinations {

    private final Map<Integer,List<Triplet>> totalScoreToTriplets = new HashMap<Integer,List<Triplet>>();

    public PossibleCombinations() {
        int[] sorted = new int[3];
        for(int i = 0; i <= 10; i ++)
        {
            for(int j = 0; j <= 10; j ++)
            {
                for(int k = 0; k <= 10; k ++)
                {
                    sorted[0] = i;
                    sorted[1] = j;
                    sorted[2] = k;

                    Arrays.sort(sorted);

                    if (isPossibleTriplet(sorted))
                    {
                        this.addTriplet(new Triplet(sorted));
                    }
                }
            }
        }
    }

    private boolean isPossibleTriplet(int[] sorted) {
        return sorted[2] - sorted[0] <= 2;
    }

    private void addTriplet(Triplet triplet) {
        final int totalScore = triplet.getTotal();
        List<Triplet> triplets = this.totalScoreToTriplets.get(totalScore);
        if (triplets == null)
        {
            triplets = new ArrayList<Triplet>();
            this.totalScoreToTriplets.put(totalScore, triplets);
        }

        if (!triplets.contains(triplet))
        {
            triplets.add(triplet);
        }
    }

    public List<Triplet> findTripletsByTotalScore(int totalScore)
    {
        final List<Triplet> triplets = this.totalScoreToTriplets.get(totalScore);
        if (triplets == null)
        {
            throw new IllegalArgumentException("Impossible total score " + totalScore);
        }
        return triplets;
    }

}
