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 year2012.qualification.b;

import java.io.File;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class DancingWithTheGooglers {
	public static void main(String[] args) throws Exception{
		//GCJÃÃÂ±ÃÃÃ¶
		String filename = "src/year2012/qualification/b/B-small-attempt5";
		PrintWriter out = new PrintWriter(new File(filename + ".out"));
		Scanner scan = new Scanner(new File(filename + ".in"));
		
		final int T = scan.nextInt();
		
		for(int i=0;i<T;i++){
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			int[] t = new int[N];
			int ans = 0;
			for(int j=0;j<N;j++){
				t[j] = scan.nextInt();
			}

			//surprisingâÃÃÃÃÃ´ÃÂ£Ãº
			List<Integer> probableSurprising = new ArrayList<Integer>();
			
			//30âÃÂ®29âÃÂ®28âÃÃâ°Ã¦Ã£ÃÂ§Ã±
			for(int j=0;j<N;j++){
				if(t[j] == 30 || t[j] == 29 || t[j] == 28){
					ans++;
				}else if(t[j] == 0){
					if(p==0)
						ans++;
				}else if(t[j] == 1){
					if(p==1)
						ans++;
				}else{
					if((int) Math.ceil((double)t[j] / 3.0) < p){
						probableSurprising.add(t[j]);
					}else{
						ans++;
					}
				}
				
			}
			//âÃÃ¥surprisingâÃÃ£âÃÃâÃÃ³âÃÃ¥âÃâ¢âÃÃÃÃ¯ââÃÃ§âÃÃ­ÃÂ¶Ã£âÃÂ¶âÃÃâÃÃ¨âÃÃ
			Collections.sort(probableSurprising, new Comparator<Integer>(){
			      public int compare(Integer t1, Integer t2) {
			        return t2 - t1;
			      }
			    });
			for(int j=0;j<probableSurprising.size();j++){
				int best=-1;
				//ÃÃºÃÃÃ Ã¹âÃÃSÃÃÃ£âÃÃsurprising
				if(j<S){
					int mod =probableSurprising.get(j) %3;
					if(mod == 1){
						best = (probableSurprising.get(j) + 2) / 3;
					}else if(mod == 2){
						best = (probableSurprising.get(j) + 4) / 3;
					}else if(mod == 0){
						best = (probableSurprising.get(j) + 3) / 3;
					}
				}else{
					//surprisingâÃÃâÃÃâÃâ¢âÃÃÃÃ¯ââÃÃ3âÃÃÃÃ¢â¤âÃÂ£âÃÂ¶ÃÃ Ã¡âÃÃ¤â°âÃ¤âÃÃ­âÃÃ¥âÃâbestâÃÃÃÃÏâÃÃ¥ÃÃ¡â«âÃÃ£
					best =(int) Math.ceil((double)probableSurprising.get(j) / 3.0);	
				}
				if(best >= p){
					ans++;
				}
				
			}
			System.out.println("Case #"+(i+1)+": "+ ans);
			out.printf("Case #%d: %s\n", i+1, ans);
		}
		out.flush();
	}
}
