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);
	}

}

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

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

/**
 *
 * @author Calido
 */
public class Googlers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        int t,n,s,p,ti,cnt;
		try
		{
			Scanner scnr=new Scanner(new File(args[0]));
			PrintWriter out=new PrintWriter(new File(args[1]));
			t=scnr.nextInt();
			System.out.println("T: "+t);
			for(int i=1;i<=t;i++)
			{
				cnt=0;
				n=scnr.nextInt();//reading number of googlers
				s=scnr.nextInt();//reading special case
				p=scnr.nextInt();//reading point
				for(int j=0;j<n;j++)
				{
					ti=scnr.nextInt();
					if(ti>=(p+(2*(p-1))))
					{
						cnt++;
					}
					else if(ti>=(p+(2*(p-2))))
					{
						if(ti>=2 && ti<=28)
						{
							if(s>0)
							{
								cnt++;
								s--;
							}
						}
					}
				}
	
				//output to File
				out.println("Case #"+i+": "+cnt);
                                System.out.println("Case #"+i+": "+cnt);
			}
			out.close();
		}
		catch(FileNotFoundException fnfe)
		{
			System.out.println("File Not Found.");
		}

    }
}
