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 codejam.round1;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class ProblemB {
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader(args[0]));
		PrintStream out = new PrintStream(args[1]);

		int testsCount = Integer.parseInt(reader.readLine());
		for (int test = 1; test <= testsCount; test++) {
			String input = reader.readLine();
			StringTokenizer tokenizer = new StringTokenizer(input);
			int N = Integer.parseInt(tokenizer.nextToken());
			int S = Integer.parseInt(tokenizer.nextToken());
			int p = Integer.parseInt(tokenizer.nextToken());
			List<Integer> nonSurprisingExceedingP = new ArrayList<Integer>();
			List<Integer> suprisingExceedingP = new ArrayList<Integer>();
			for (int i = 0; i < N; i++) {
				int ti = Integer.parseInt(tokenizer.nextToken());
				if (bestNonSuprisingSolution(ti) >= p) {
					nonSurprisingExceedingP.add(i);
				}else if(hasSuprisingSolution(ti) && bestSuprisingSolution(ti) >=p) {
					suprisingExceedingP.add(i);
				}
			}
			int googlersCount = nonSurprisingExceedingP.size() + Math.min(S, suprisingExceedingP.size());
			out.println(String.format("Case #%s: %s", test, googlersCount));
		}

		out.close();
		reader.close();
	}

	private static int nearestUpperMultipleOfThree(int a) {
		if (a == 0 || a % 3 == 0) {
			return a;
		}
		return a + (3 - (a % 3));
	}

	private static int nearestMultipleOfThree(int a) {
		if (a == 0 || a % 3 == 0) {
			return a;
		}
		if (a % 3 == 1) {
			return a - 1;
		}
		return a + 1;
	}

	private static int bestNonSuprisingSolution(int total) {
		return nearestUpperMultipleOfThree(total) / 3;
	}

	private static boolean hasSuprisingSolution(int total) {
		return total > 1;
	}

	private static int bestSuprisingSolution(int total) {
		return (nearestMultipleOfThree(total) / 3) + 1;
	}
}
