package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}


package codejam2012.B;

import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author Rymbu VV
 */
public class DancingWithGooglers {

    private Scanner sc;
    private PrintWriter pw;
    private int CASES;
    
    public static void main(String[] args) {
        DancingWithGooglers suk = new DancingWithGooglers("c:\\bl.in", "c:\\bl.out");
        suk.execute();
    }
    
    public DancingWithGooglers(String fileIn, String fileOut) {
        try{
            sc = new Scanner(new File(fileIn));
            pw = new PrintWriter(new FileWriter(fileOut));
            CASES = sc.nextInt();
        }catch(Exception e){System.out.println("In Constructor "+e);}
    }
    
    public void execute(){
        int N, S, p, count;
        for(int ncase = 1; ncase <= CASES; ncase++){
            pw.print("Case #"+ncase+": ");
            
            N = sc.nextInt();
            S = sc.nextInt();
            p = sc.nextInt();
            count = 0;
            for (int i=0; i<N; i++){
                int t = sc.nextInt();
                if (t>=p && (t/3) >= p ){
                    count++;
                    continue;
                }
                int tmp = t-p;
                if (t>=p && (p-(tmp/2)) <= 1){
                    count++;
                    continue;
                }
                if (S>0 && t>=p && (p-(tmp/2)) <= 2){
                    count++;
                    S--;
                }
            }
            
            pw.println(count);
        }
        pw.flush();
        pw.close();
        sc.close();
    }
}
