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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class B {
	public static void main(String[] args) throws IOException {
		Scanner sc;
		try {
			sc = new Scanner(new File("B"));
			FileWriter writer = null;
			try {
				writer = new FileWriter(new File("output"));
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		
			int nbLines = Integer.parseInt(sc.nextLine());
			int currentLine = 1;
			
			int nbGooglers;
			int surprising;
			int p;
			String line ="";
			
			int currentGoogler;
			
			int g;
			
			int quotient;
			int reste;
			
			int res;
			while (currentLine <= nbLines) {
				writer.write("Case #"+currentLine+": ");
				res=0;
				currentGoogler = 1;
				line = sc.nextLine();
				Scanner scan = new Scanner(line);
				nbGooglers=scan.nextInt();
				surprising = scan.nextInt();
				p=scan.nextInt();
				while (currentGoogler <= nbGooglers) {
					g = scan.nextInt();
					quotient = g/3;
					reste = g % 3;
					System.out.println(g + " " +quotient + " " + p);
					if (g == 0 && p > 0)
						;
					else if (quotient >= p)
						res++;
					else {
						if ((quotient == (p - 1)) && (reste >= 1))
							res++;
						else if (quotient == (p - 2) && (reste == 2) && (surprising != 0)) {
							surprising --;
							res++;
						}
						else if (quotient == (p - 1) && (reste == 0) && (surprising != 0)) {
							surprising --;
							res++;
						}
							
					}
					currentGoogler++;
				}
				writer.write(res + "\n");
				currentLine++;
			}
			writer.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}
