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

import java.io.File;
import java.util.Arrays;
import java.util.Scanner;

public class Qualif2 {

    public static void main(String[] args) throws Exception {

        Scanner scan = new Scanner(new File("input"));

        int num = Integer.parseInt(scan.nextLine());

        for (int i = 1; i <= num; i++) {
            int googlers = scan.nextInt();
            int surprising = scan.nextInt();
            int score = scan.nextInt();

            int[] totals = new int[googlers];

            for (int j = 0; j < googlers; j++) {
                totals[j] = scan.nextInt();
            }

            System.out.println("Case #" + i + ": " + solve(googlers, surprising, score, totals));
        }
    }

    private static int solve(int googlers, int surprising, int score, int[] totals) {
        Arrays.sort(totals);
        int count = 0;

        if (score == 0) {
            return googlers;
        }

        for (int i = totals.length - 1; i >= 0; i--) {
            int total = totals[i];
            if (total > 28) {
                count++;
                continue;
            }

            if (total == 0) {
                continue;
            }

            int base = total / 3;
            int r = total % 3;

            int n = base + (r > 0 ? 1 : 0);

            if (n >= score) {
                count++;
            } else if (surprising > 0) {
                surprising--;
                if (n + (r == 1 ? 0 : 1) >= score) {
                    count++;
                }
            } else {
                break;
            }
        }

        return count;
    }
}
