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 com.dennis.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class DancingGoogle {

	/**
	 * @param args
	 */
	
	public static void main(String[] args) throws IOException{

		
		BufferedReader fin = new BufferedReader(new FileReader("dancing.in"));
		PrintWriter fout = new PrintWriter(new BufferedWriter(new FileWriter("dancing.out")));

		StringTokenizer stringy;
		
		int times = Integer.parseInt(fin.readLine());
		
		
		for(int x= 0 ; x<times; x++){
			stringy= new StringTokenizer(fin.readLine());
			int numg = Integer.parseInt(stringy.nextToken());
			int surprises = Integer.parseInt(stringy.nextToken());
			int limit  = Integer.parseInt(stringy.nextToken());
			int[] googlers = new int[numg];
			
			for(int a = 0; a<numg; a++){
				googlers[a] = Integer.parseInt(stringy.nextToken());
			}
			
			Arrays.sort(googlers);
			
			int[] less = new int[numg];
			
			
			
			for(int a = 0; a<numg; a++){
				
				if(googlers [a] <= 1){
					if(googlers[a]==1) less[a] = 1;
					if(googlers[a]==0) less[a] = 0;
				}				
				else if(googlers[a]%3 == 0){
					less[a] = googlers[a]/3;  
				}
				else if(googlers[a]%3 == 1){
					less[a] = googlers[a]/3+1;
				}
				else if(googlers[a]%3 == 2){
					less[a] = googlers[a]/3+1;
				}
				
			}

			int[] more = new int[numg];
			for(int a = 0; a<numg; a++){
				
				if(googlers [a] <= 1){
					if(googlers[a]==1) more[a] = 1;
					if(googlers[a]==0) more[a] = 0;
				}				
				else if(googlers[a]%3 == 0){
					more[a] = googlers[a]/3+1;  
				}
				else if(googlers[a]%3 == 1){
					more[a] = googlers[a]/3+1;
				}
				else if(googlers[a]%3 == 2){
					more[a] = googlers[a]/3+2;
				}
				
			}
			
			for(int a= 0 ; a<numg;a++){
				if(surprises==0) break;
				
				if(more[a]!= less[a] && more[a] == limit){
					surprises--;
					less[a] = more[a];
				}
				
				
			}
			
			
			
			
			int count =0;
			for(int c=0; c<numg; c++){
				System.out.println(less[c]);
				if(less[c]>=limit) count++;
			}
			
			fout.println("Case #" + (x+1) + ": " + count);
			
		}
		
		
		
		
		
		fout.close();
		System.exit(0);

	}

}
