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 qualification2012;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;

public class Dancing {

	static int bestScoreWithoutSurprise(int t) {
		if(t < 2) return t;
		if(t > 27) return 10;
		return t % 3 == 0 ? t / 3 : t / 3 + 1;
	}
	
	static int bestScoreWithSurprise(int t) {
		if(t < 2) return t;
		if(t > 27) return 10;
		return t % 3 == 2 ? t / 3 + 2 : t / 3 + 1;
	}
	
	static int solve(int[] t, int S, int p) {
		int result = 0;
		for (int i = 0; i < t.length; i++) {
			if(bestScoreWithoutSurprise(t[i]) >= p)
				result++;
			else if(S > 0 && bestScoreWithSurprise(t[i]) >= p) {
				S--;
				result++;
			}
				
		}
		return result;
	}

	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader(args[0]));
		PrintWriter writer = new PrintWriter(args[1]);
		int ntests = Integer.parseInt(reader.readLine());
		for (int test = 0; test < ntests; test++) {
			String[] fields = reader.readLine().split(" ");
			int N = Integer.parseInt(fields[0]);
			int S = Integer.parseInt(fields[1]);
			int p = Integer.parseInt(fields[2]);
			int[] t = new int[N];
			for (int i = 0; i < N; i++)
				t[i] = Integer.parseInt(fields[i + 3]);
			writer.println("Case #" + (test + 1) + ": " + solve(t, S, p));
		}
		writer.close();
	}
}
