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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;

/**
 * Magicka
 */
public class B {
	public static void main(String[] args) throws FileNotFoundException {
		Kattio io;

//		io = new Kattio(System.in, System.out);
//		io = new Kattio(new FileInputStream("src/qual2012/B-sample.in"), System.out);
		io = new Kattio(new FileInputStream("src/qual2012/B-small-attempt1.in"), new FileOutputStream("src/qual2012/B-small-1.out"));
//		io = new Kattio(new FileInputStream("src/qual2012/B-large.in"), new FileOutputStream("src/qual2012/B-large.out"));

		int cases = io.getInt();
		for (int i = 1; i <= cases; i++) {
			io.print("Case #" + i + ": ");
			new B().solve(io);
		}
		io.close();
	}

	private void solve(Kattio io) {
		int n = io.getInt(), m = io.getInt(), p = io.getInt();

		boolean[] okNormal = new boolean[31];
		boolean[] okSurprising = new boolean[31];

		for (int i = 0; i <= 10; i++) {
			for (int j = i; j <= 10; j++) {
			    for (int k = j; k <= 10; k++) {
			   		if (k > i+2) continue;
					if (k >= p) {
						if (k > i+1)
							okSurprising[i+j+k] = true;
						else
							okNormal[i+j+k] = true;
					}
			    }
			}
		}

		int cnt = 0;
		for (int i = 0; i < n; i++) {
		    int score = io.getInt();
			if (okNormal[score]) cnt++;
			else if (m > 0 && okSurprising[score]) { cnt++; m--; }
		}
		io.println(cnt);

	}
}
