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.
 */
import java.io.*;
import java.util.*;

/**
 *
 * @author Tareq:
 * I want to dance with a googler too! ;(
 */
public class Dance {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        String line;
        StringTokenizer st;
        int T;
        int N,S,p;
        try{
            BufferedReader reader = new BufferedReader(new FileReader("B-large.in"));
            PrintWriter pw = new PrintWriter(new FileOutputStream("Dance-large.out"));
            T = Integer.parseInt(reader.readLine());
            for(int k=1;k<=T;k++)
            {
                int numOfBest =0;
                int minScore;
                line = reader.readLine();
                st = new StringTokenizer(line);
                N = Integer.parseInt(st.nextToken());
                S = Integer.parseInt(st.nextToken());
                p = Integer.parseInt(st.nextToken());
                minScore = p*3;
                for(int i=0;i<N;i++)
                {
                    int tscore = Integer.parseInt(st.nextToken());

                        if(tscore>=minScore-2)
                            numOfBest++;
                        else if(tscore>=minScore-4)
                            if(S>0 && p>1)
                            {   numOfBest++;
                                S--;
                            }
                }
                pw.println("Case #"+k+": "+numOfBest);
            }
            
            pw.close();
        }catch(Exception e){System.out.println("hmm"+e);}            
    }
}
