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

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class GoogleCodeJam {
    
    public static int calcGooglers(int p, int s, int[] g) {
        int avg = p*3;
        int n = g.length;
        int cont = 0;
        for (int i = 0; i< n; i++) {
            if (g[i] >= avg ) {
                cont++;
            } else if (avg == 0){
                cont++;
            } else if (g[i] >= avg-2 && avg-2 >= p) {
                cont++;
            } else if (g[i] >= avg-4 && avg-4 >= p) {
                if (s > 0) {
                    cont++;
                    s--;
                }
            }
        }
        return cont;
    }
    
    public static void doIt() throws Exception {
        Scanner sc = new Scanner(new FileReader("/home/fuelusumar/input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("/home/fuelusumar/output.txt"));
        int caseCnt = sc.nextInt();
        for (int caseNum = 0; caseNum < caseCnt; caseNum++) {
            pw.print("Case #" + (caseNum + 1) + ": ");
            /***********************************************/
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] g = new int[n];
            for (int googler = 0; googler < n; googler++) {
                g[googler] = sc.nextInt();
            }
            /***********************************************/
            pw.println(calcGooglers(p,s,g));
        }
        pw.flush();
        pw.close();
        sc.close();
    }
    
    
    public static void main(String[] args) throws Exception {
        doIt();
    }
}
