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.techy.rajeev;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingGame2 {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("techyrajeev.txt"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("myoutput.out"));
		int num=Integer.valueOf(in.readLine().trim());
		int count = 0, l = 1;
		while (num > 0) {
			int arrtemp[]=toIntArray(in.readLine());
			int N = arrtemp[0];
			int S = arrtemp[1];
			int p=arrtemp[2];
			for(int i=3;i<arrtemp.length;i++){
				int base=arrtemp[i]/3;
				switch(arrtemp[i]%3){
				case 0:{
						if(base>=p){
							count++;
						}else{
							if(S>0 && base>0 && base+1>=p){
								count++;
								S--;
							}
						}
					}break;
				case 1:{
					if(base>=p || base+1>=p){
						count++;
					}else{
						if(S>0 && base+1>=p){
							count++;
							S--;
						}
					}
				}break;
				case 2:{
					if(base+1>=p || base>=p){
						count++;
					}else{
						if(S>0 && base+2>=p){
							count++;
							S--;
						}
					}
				}break;
				}
			}
			num--;
			System.out.println("Case #"+l+": "+count);
			bw.write("Case #"+l+": "+count);
			bw.newLine();
			count=0;
			l++;
		}
		in.close();
		bw.close();
	}
	public static int[] toIntArray(String line){
		String[] p = line.trim().split("\\s+");
		int[] out = new int[p.length];
		for(int i=0;i<out.length;i++) out[i] = Integer.valueOf(p[i]);
		return out;
	}


}
