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

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;
import java.util.StringTokenizer;

public class B {

	public static void main(String[] args) throws NumberFormatException,
			IOException {
		BufferedReader buffer = new BufferedReader(new FileReader(
				"B-small-attempt0.in"));
		int t = Integer.parseInt(buffer.readLine());
		for (int i = 0; i < t; i++) {
			String kase = buffer.readLine();
			StringTokenizer tokenizer = new StringTokenizer(kase);
			int n = Integer.parseInt(tokenizer.nextToken());
			int s = Integer.parseInt(tokenizer.nextToken());
			int p = Integer.parseInt(tokenizer.nextToken());
			int[] scores = new int[n];
			for (int j = 0; j < scores.length; j++) {
				scores[j] = Integer.parseInt(tokenizer.nextToken());
			}
			boolean done = false;
			int solution = 0, sdash = 0;
			int x = 0;
			for (int k = 0; k < n && !done; k++) {
				int make = make(scores[k], p);
				if (make == 0)
					x++;
				else if (make == 1 && s > sdash) {
					x++;
					sdash++;
				}
			}
			solution = x;
			System.out.printf("Case #%d: %d\n", (i + 1), solution);
		}
	}

	private static int make(int i, int p) {
		i -= p;
		if (i > 2 * p)
			return 0;
		if (i < 0)
			return -1;
		if (i > 2 * p - 3 && i < 2 * p + 3)
			return 0;
		if (i > 2 * p - 5 && i < 2 * p + 5)
			return 1;

		return -1;
	}
}
