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.util.Scanner;

/**
 *
 * @author Yasura
 */
public class B {

    public static void main(String[] args) {
        Scanner scanInt= new Scanner(System.in);
        int noOfCases = scanInt.nextInt();
        int N,S,p,t,max;
        for(int i=0;i<noOfCases;i++){
            N=scanInt.nextInt();
            S=scanInt.nextInt();
            p=scanInt.nextInt();
            max=0;
            for(int j=0;j<N;j++){
                t=scanInt.nextInt();
                if(t%3==0){
                    if(t/3>p-1){
                        max++;
                    }
                    else if((t/3==p-1)&&S!=0&&t>2){
                        max++;
                        S--;
                    }
                }
                else if(t%3==1 && (t+2)/3>p-1){
                    max++;
                }
                else if (t%3==2){
                    if((t+1)/3>p-1){
                        max++;
                    }
                    else if ((t+1)/3==p-1&&S!=0){
                        max++;
                        S--;
                    }
                }
            }
            System.out.println("Case #"+(i+1)+": "+max);
        }
    }
}
