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 qualification_round;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class A_sl_Dansing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try {
			Scanner inp = new Scanner(new FileInputStream("A_s_input.txt"));
			int i=0,j=0,k=0,tc=0;
			int T = inp.nextInt();
			inp.nextLine();
			for(tc=0;tc<T;tc++){
				int N = inp.nextInt();
				int S = inp.nextInt();
				int P = inp.nextInt();
				int arr[] = new int[N];
				
				for(i=0;i<N;i++){
					arr[i] = inp.nextInt();
				}
				
				inp.nextLine();
				
				int arr1[] = new int[N];
				int arr2[] = new int[N];
				
				for(i=0;i<N;i++){
					arr1[i] = arr[i]/3;
					arr2[i] = arr[i] % 3;
				}
				
				int result = 0;
				for(i=0;i<N;i++){
					if(arr2[i] == 0){
						if(arr1[i] >= P){
							result++;
						}
						else if(arr1[i]+1 == P && arr1[i] != 0 && S>0){
							S--;
							result++;
						}
					}
					else if(arr2[i] == 1 && arr1[i]+1 >= P){
						result++;
					}
					else if(arr2[i] == 2){
						if(arr1[i]+1 >= P){
							result++;
						}
						else if(arr1[i]+2 == P && S>0){
							result++;
							S--;
						}
					}
				}
				
				k=tc+1;
				System.out.println("Case #" + k +": "+result);
				
			}
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
	}

}
