package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}
package com.google.dancing;

import java.util.Scanner;

import com.google.util.FileUtil;

/*
 *
 *
 */
public class Dancing {

	public static void main(String[] args) {
		String orgFilePath = "E:\\Google_Jam\\Dancing\\B-small-attempt6.in";
		Scanner scanner = FileUtil.openFile(orgFilePath);
		StringBuilder sb = new StringBuilder();

		int caseNum = Integer.valueOf(scanner.nextLine());
		for (int i = 0; i < caseNum; i++) {
			sb.append("Case #" + (i + 1) + ": ");
			String line = scanner.nextLine();
			String[] numbers = line.split(" ");
			// String[] numbers = {"15"};
			int n = 0;// ´ïµ½×î´óÖµµÄ¸öÊý
			int googlers = Integer.valueOf(numbers[0]);// Ñ¡ÊÖ¸öÊý
			int suprising = Integer.valueOf(numbers[1]);// µÃ·Ö²î´óÓÚ2
			int max = Integer.valueOf(numbers[2]);// ÆÚÍûÖµ
			/*
			 * int googlers = 1; int suprising =1; int max = 3;
			 */
			for (int j = 0; j < googlers; j++) {
				int temp = Integer.valueOf(numbers[j + 3]);// µ±Ç°Ñ¡ÊÖËùµÃ×Ü·Ö
				// int temp = Integer.valueOf(numbers[0]);
				if (temp / 3 >= max) {
					n++;
				} else if ((max - (temp / 3) == 1)
						&& ((temp / 3) + (temp % 3)) >= max) {
					n++;
				} else if ((max - (temp / 3)) > 1
						&& ((temp / 3) + (temp % 3)) >= max && suprising > 0) {
					n++;
					suprising--;
				} else if (temp != 0 && max - temp / 3 == 1 && suprising > 0
						&& temp % 3 == 0) {
					n++;
					suprising--;
				}
			}
			sb.append(n);
			sb.append("\n");
		}
		FileUtil.writeFile(sb, "Dancing\\small1.in");
	}
}
