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 codejam2012.r0;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author julian
 */
public class B {

	public static final void main(String[] args) throws IOException {
		(new B()).run();
	}

	private int getBestRes(int v) {
		return ((v % 3 == 0) ? 0 : 1) + ((int) v / 3);
	}

	private int getBestSurRes(int v) {
		return ((v % 3 == 2) ? 2 : Math.min(v, 1)) + ((int) (v / 3));
	}

	public void run() throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-small.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("B.out"));
		int t = Integer.parseInt(in.readLine());
		for (int i = 0; i < t; i++) {
			StringTokenizer stok = new StringTokenizer(in.readLine());
			int n = Integer.parseInt(stok.nextToken());
			int s = Integer.parseInt(stok.nextToken());
			int p = Integer.parseInt(stok.nextToken());
			int[] total = new int[n];
			for (int k = 0; k < n; k++) {
				total[k] = Integer.parseInt(stok.nextToken());
			}
			out.write("Case #" + (i + 1) + ": " + solve(n, s, p, total) + "\n");
		}
		in.close();
		out.flush();
		out.close();
	}

	public int solve(int n, int s, int p, int[] t) {
		int good = 0;
		int soso = 0;
		for (int i = 0; i < n; i++) {
			if (getBestRes(t[i]) >= p) {
				good++;
			} else if (getBestSurRes(t[i]) >= p) {
				soso++;
			}
		}

		return good + Math.min(s, soso);
	}

}
