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 codejam02;
import java.io.*;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.StringTokenizer;
public class CodeJam02
{
    public static void main(String[] args)
    {
        try
        {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int T,N,S,p,score;
            String input,output;
            int maxGooglers,temp ;
            T = Integer.parseInt(br.readLine());
            for (int i=0;i<T;i++)
            {
                maxGooglers = 0;
                temp = 0;
                input = br.readLine();
                StringTokenizer st = new StringTokenizer(input);
                N = Integer.parseInt(st.nextToken());
                S = Integer.parseInt(st.nextToken());
                p = Integer.parseInt(st.nextToken());
                for (int j=0; j<N; j++)
                {
                    score = Integer.parseInt(st.nextToken());
                    if(p<2)
                    {
                        if(score >= p) maxGooglers++;
                    }
                    else
                    {
                        if(score==(3*p-4)||score==(3*p-3))
                        {
                            temp++;
                        }
                        else if(score>(3*p-3))
                        {
                            maxGooglers++;
                        }
                    } 
                }
                if(temp<S) maxGooglers+=temp;
                else maxGooglers+=S;
                System.out.println("Case #" +(i+1) + ": " + maxGooglers);
            }
        }
        catch (IOException ex)
        {
            Logger.getLogger(CodeJam02.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
}
