/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package IO;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
    
/**
 * 
 * @author dannocz
 */
public class InputReader {
    
    public static Input readFile(String filename){
        try {
              
              /*  Sets up a file reader to read the file passed on the command
          77        line one character at a time */
              FileReader input = new FileReader(filename);
              
              /* Filter FileReader through a Buffered read to read a line at a
                 time */
              BufferedReader bufRead = new BufferedReader(input);
              
              String line;    // String that holds current file line
              int count = 0;  // Line number of count 
              ArrayList<String> cases= new ArrayList<String>();
              
              // Read first line
              line = bufRead.readLine();
              int noTestCases=Integer.parseInt(line);
              count++;
              
              // Read through file one line at time. Print line # and line
              while (count<=noTestCases){
                  //System.out.println("Reading. "+count+": "+line);
                  line = bufRead.readLine();
                  cases.add(line);
                  count++;
              }
              
              bufRead.close();
              
              return new Input(noTestCases,cases);
              
          }catch (ArrayIndexOutOfBoundsException e){
              /* If no file was passed on the command line, this expception is
              generated. A message indicating how to the class should be
              called is displayed */
              e.printStackTrace();        
  
          }catch (IOException e){
              // If another exception is generated, print a stack trace
              e.printStackTrace();
          }
        
        return null;
          
      }// end main
    }

package codejam2012;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 *
 * @author devashish
 */
public class ProblemB {

    public static void main(String[] args) {
        StringTokenizer st = null;
        BufferedReader in;
        PrintWriter out = null;
        try {
            in = new BufferedReader(new FileReader(new File("E:/b.in")));
            out = new PrintWriter(new FileWriter(new File("E:/b.out")));

            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(in.readLine());
            }
            int t = Integer.parseInt(st.nextToken());
            for (int i = 1; i <= t; i++) {
                while (st == null || !st.hasMoreTokens()) {
                    st = new StringTokenizer(in.readLine());
                }

                int N = Integer.parseInt(st.nextToken());
                int S = Integer.parseInt(st.nextToken());
                int p = Integer.parseInt(st.nextToken());
                int[] T = new int[N];
                for (int j = 0; j < N; j++) {
                    T[j] = Integer.parseInt(st.nextToken());
                }

                int outputLine = maxGooglers(N, S, p, T);

                out.print("Case #" + i + ": " + outputLine + "\n");
            }
        } catch (IOException e) {
        }
        out.flush();
    }

    private static int maxGooglers(int N, int S, int p, int[] T) {
        int output = 0;

        int surprisingMinScore = Math.max(3 * p - 4, 0) ;
        int nonSurprisingMinScore = Math.max(3 * p - 2, 0);
        int countSurprise = 0;
        
       // System.out.println(surprisingMinScore);
       // System.out.println(nonSurprisingMinScore);

        for (int i = 0; i < T.length; i++) {
            //    System.out.println(T[i]);            
         //   System.out.println("T[i]: " + T[i]);
            if (T[i] < surprisingMinScore) {
                continue;
            } else if (T[i] >= surprisingMinScore && T[i] < nonSurprisingMinScore) {
                //either surprising or low scores
                //countSurprise += findPossibleSurprisingScoresWithBestResult(T[i], p);
                if (S > 0 && T[i] >= 2) {
                    countSurprise += findPossibleSurprisingScoresWithBestResult(T[i], p);
           //         System.out.println("#countSurprise: " + countSurprise);
                    //output += findPossibleSurprisingScoresWithBestResult(T[i], p);
                }                
            } else if (T[i] >= nonSurprisingMinScore) {
                //Non surprising score
                //System.out.println("non surprising score.");
                output++;
            }          
        }
        
        //System.out.println("#output: " + output);
        //System.out.println((countSurprise < S ? countSurprise : S));
        return output + (countSurprise < S ? countSurprise : S);
    }
    
    private static int findPossibleSurprisingScoresWithBestResult(int t, int p) {
        int count = 0;
        int a = t/3;
        int b = ((t + 4)/3);

        if (p >= a && p <=b) {
            count++;
        }
        //System.out.println("#count:" + count);
        return count;
    }
}
