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

import java.io.*;
import java.util.*;
public class DancingG {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int count=0;
		try {
			File file = new File("B-small-attempt0.in");
			FileOutputStream out=new FileOutputStream("output.out");
			Scanner in=new Scanner(new FileReader(file) );
			int t=in.nextInt();
			
			while (t!=0) {
				count++;
				int a=0;
				int n=in.nextInt();
				int s=in.nextInt();
				int p=in.nextInt();
				int ti[]=new int[n];
				int m[][]=new int[n][3];
				int cn=0;
				for(int i=0;i<n;i++)
				{
					ti[i]=in.nextInt();
					m[i][0]=ti[i]/3;
					m[i][1]=ti[i]/3;
					m[i][2]=ti[i]/3;
					if((ti[i]%3)==2)
					{
						m[i][0]++;
						m[i][1]++;
					}
					if((ti[i]%3)==1)
						m[i][0]++;
					
					if((m[i][0]<p) &(m[i][0]>=1))
					{
						a=p-m[i][0];
						if(a==1 & s>0)
						{
							if((m[i][0]==m[i][1])&(m[i][1]==m[i][2]))
							{
								m[i][0]+=1;
								m[i][1]--;
								s--;
							}
							else
							{
								if((m[i][0]==m[i][1])&((m[i][1]-m[i][2])==1))
								{
									m[i][0]+=1;
									m[i][1]--;
									s--;
								}
							}
						}
					}
					if(m[i][0]>=p)
						cn++;
				}
				
				
					out.write(("Case #"+count+": "+cn+"\n").getBytes());
					System.out.print("case #"+count+": "+cn+"\n");
					t--;
			}
			
		} catch (Exception e) {
			// TODO: handle exception
		}
	
	}

}
