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 codezam.exercise.WR1B2012;

public class Triplet {
	long numberA;
	long numberB;
	long numberC;
	boolean isSurprising = false;
	long numberMax;
	
	public Triplet(long numberA, long numberB, long numberC) {
		this.numberA = numberA;
		this.numberB = numberB;
		this.numberC = numberC;
		
		//Valid ÇÏ°Ô µé¾î¿Â´Ù°í °¡Á¤
		if (numberA==numberB+2 || numberA==numberC+2 
				|| numberB==numberA+2 || numberB==numberC+2
				|| numberC==numberA+2 || numberC==numberB+2) {
			isSurprising = true;
		}
		
		if (numberA>=numberB && numberA>=numberC) {
			numberMax = numberA;
		} else if (numberB>=numberA && numberB>=numberC) {
			numberMax = numberB;
		} else if (numberC>=numberA && numberC>=numberB) {
			numberMax = numberC;
		} else {
			numberMax = numberA;//¼öÇÐÀûÀ¸·Î ÀÌ·± °æ¿ì´Â ¾øÀ½
		}
		
	}
	
	public long getNumberA() {
		return numberA;
	}
	public void setNumberA(long numberA) {
		this.numberA = numberA;
	}
	public long getNumberB() {
		return numberB;
	}
	public void setNumberB(long numberB) {
		this.numberB = numberB;
	}
	public long getNumberC() {
		return numberC;
	}
	public void setNumberC(long numberC) {
		this.numberC = numberC;
	}
	public boolean isSurprising() {
		return isSurprising;
	}
	public void setSurprising(boolean isSurprising) {
		this.isSurprising = isSurprising;
	}
	public long getNumberMax() {
		return numberMax;
	}
	public void setNumberMax(long numberMax) {
		this.numberMax = numberMax;
	}
		
}

