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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;

public class GoogleDance {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader reader=new BufferedReader(new FileReader(new File(System.getProperty("user.home")+File.separator+"Desktop"+File.separator+"input.txt")));
		PrintWriter output=new PrintWriter(new File(System.getProperty("user.home")+File.separator+"Desktop"+File.separator+"output.txt"));
		int cases=Integer.parseInt(reader.readLine());
		for(int i=0;i<cases;i++){
			output.print("Case #"+(i+1)+": ");
			String[] params=reader.readLine().split("\\s");
			int N=Integer.parseInt(params[0]);
			int S=Integer.parseInt(params[1]);
			int p=Integer.parseInt(params[2]);
			int[] totals=new int[N];
			for(int j=0;j<N;j++){
				totals[j]=Integer.parseInt(params[j+3]);
			}
			Arrays.sort(totals);
			int found=0;
			int track=0;
			int qualified=0;
			while(found<S && track<N){
				if(totals[track]>0){
					if(totals[track]%3==2){
						if((totals[track]/3)+2>=p){
							qualified++;
							found++;
						}
					}else if(totals[track]%3==0){
						if((totals[track]/3)+1>=p){
							qualified++;
							found++;
						}
					}else{
						if(totals[track]/3+1>=p){
							qualified++;
						}
					}
				}
				else{
					if(p==0){
						qualified++;
					}else{
						if(totals[track]%3==1){
							if(totals[track]/3+1>=p){
								qualified++;
							}
						}
					}
				}
				track++;
			}
			while(track<N){
				if(totals[track]>0){
					if(totals[track]%3>=1){
						if(totals[track]/3+1>=p){
							qualified++;
							track++;
							break;
						}
					}else{
						if(totals[track]/3>=p){
							qualified++;
							track++;
							break;
						}
					}
				}else{
					if(p==0){
						qualified++;
						track++;
						break;
					}
				}
				track++;
			}
			if(track<N){
				qualified+=N-track;
			}
			output.print(qualified);
			output.println();
		}
		output.close();
		reader.close();
	}
}