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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class ProblemB {
    public static void main(String[] args) throws IOException {
        BufferedReader leer= new BufferedReader(new InputStreamReader(System.in));
        int T=intS(leer.readLine());
        for (int i = 1; i <= T; i++) {
            StringTokenizer st= new StringTokenizer(leer.readLine());
            int N=intS(st.nextToken());
            int S=intS(st.nextToken());
            int p=intS(st.nextToken());
            int[][] g= new int[N][3];
            for (int j = 0; j < N; j++){
                int v=intS(st.nextToken());
                g[j][0]=v/3;
                g[j][1]=v%3;
                int score[]={g[j][0],g[j][0],g[j][0]};
                if(g[j][1]>=1)
                    score[0]++;
                if(g[j][1]==2)
                    score[1]++;
                if(score[0]>=p)
                    g[j][2]=2;
                else if(score[0]+1>=p && score[0]-score[1]==0 && score[0]!=0 )
                    g[j][2]=1;
                else
                    g[j][2]=0;
            }
            int r=0;
            for (int j = 0; j < N; j++){
                if(g[j][2]==1 && S>0){
                    g[j][2]=2;
                    S--;
                }
                if(g[j][2]==2)
                    r++;
            }
            System.out.println("Case #"+i+": "+r);
        }
    }
    static int intS(String s){
        return Integer.parseInt(s);
    }
}
