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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;

public class GoogleDancers {

	public static void main(String[] args) throws FileNotFoundException {
		Scanner in = new Scanner(new File("input.txt"));
		BufferedWriter out = null;
		try {
			FileWriter fstream = new FileWriter("out.txt");
			out = new BufferedWriter(fstream);
			int cases = in.nextInt();
			for (int i = 0; i < (cases); i++) {
				int result = 0;
				int n = in.nextInt();
				int s = in.nextInt();
				int tempS = s;
				int possSup = 0;
				int p = in.nextInt();
				for (int j = 0; j < n; j++) {
					int current = in.nextInt();
					int div = current / 3;
					int mod = current % 3;
					switch (mod) {
					case 0:
						if (div >= p) {
							result++;
							if (div + 1 < 11)
								possSup++;
						} else if (div != 0 && div + 1 >= p) {
							result++;
							tempS--;
						} else if (div != 0) {
							possSup++;
						}
						break;
					case 1:
						if (div + 1 >= p) {
							result++;
						}
						possSup++;
						break;
					case 2:
						if (div + 1 >= p) {
							result++;
							if (div + 2 < 11)
								possSup++;
						} else if (div + 2 >= p) {
							result++;
							tempS--;
						} else
							possSup++;
						break;
					default:
						break;
					}
				}
				if (tempS < 0) {
					result = result + tempS;
				} else if (tempS > 0) {
					if (possSup < tempS)
						result = result - (tempS - possSup);
				}
				System.out.println(result);
				out.write("Case #" + (i + 1) + ": " + result + "\n");
			}
			out.close();
		} catch (Exception e) {// Catch exception if any
			e.printStackTrace();
			System.err.println("Error: " + e.getMessage());
		}
	}
}
