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

}

import java.io.*;
public class codejam2 
{
    public static void main(String args[]) throws FileNotFoundException, IOException
    {
        String address="g:\\cj2.txt";
        BufferedReader br = new BufferedReader(new FileReader(address));
        int test_case=Integer.parseInt(br.readLine());
        int iindex,jindex,N,S,p;
        int ul,ll;
        int select;
        String str,temp[];
        for(iindex=0;iindex<test_case;iindex++)
        {
            select=0;
            str=br.readLine();
            temp=str.split(" ");
            N=Integer.parseInt(temp[0]);
            S=Integer.parseInt(temp[1]);
            p=Integer.parseInt(temp[2]);
            ul=(p*3)-2;
            ll=ul-2;
            for(jindex=3;jindex<N+3;jindex++)
            {
                if(Integer.parseInt(temp[jindex])==0)
                    continue;
                if(Integer.parseInt(temp[jindex])>=ul)
                    select++;
                else if(Integer.parseInt(temp[jindex])>=ll)
                {
                    if(S>0)
                    {
                        S--;
                        select++;
                    }
                }
                
            }
            System.out.print("Case #"+(iindex+1)+": ");
            System.out.println(select);
        }
        
    }
    
}
