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 org.mikeyin;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;

/**
 * @author yincrash
 *
 */
public class DancingWithGooglers
{

  /**
   * @param args
   */
  public static void main(String[] args)
  {

    try
    {
      Scanner file = new Scanner(new File(args[0]));
      int testCases = file.nextInt();
      file.nextLine();
      int currentCase = 1;
      final PrintStream ps = new PrintStream(new File("dancers.out"));
      while (currentCase <= testCases) {
        final int numGooglers = file.nextInt();
        final int numSurprises = file.nextInt();
        final int atLeastScore = file.nextInt();
        
        ArrayList<Integer> totalScores = new ArrayList<Integer>(numGooglers);
        
        for (int i = 0; i < numGooglers; i++) {
          totalScores.add(file.nextInt());
        }
        
        ps.append("Case #").print(currentCase);
        ps.append(": ");

        ps.println(getMaxPossibleWithAtLeastScore(totalScores, numSurprises, atLeastScore));
        
        currentCase++;
      }
    } catch (FileNotFoundException e)
    {
      e.printStackTrace();
    }
  }

  private static int getMaxPossibleWithAtLeastScore(
      ArrayList<Integer> totalScores, int numSurprises, int atLeastScore)
  {
    int maxPossible = 0;
    for (int score : totalScores) {
      int mean = score / 3;
      int remainder = score % 3;
      
      switch (remainder) {
        case 2:
          if (mean + 1 >= atLeastScore) {
            maxPossible++;
          }
          else if (numSurprises > 0 && mean + 2 >= atLeastScore) {
            numSurprises--;
            maxPossible++;
          }
          break;
        case 1:
          if (mean + 1 >= atLeastScore) {
            maxPossible++;
          }
          break;
        case 0:
          if (mean >= atLeastScore)
            maxPossible++;
          else if (numSurprises > 0 && mean != 0 && mean + 1 >= atLeastScore) {
            numSurprises--;
            maxPossible++;
          }
          break;
      }
    }
    
    return maxPossible;
  }

}
