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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;


public class GCJ2012QA
{

    public static void main(String[] args) throws Exception
    {
        Scanner sc = new Scanner(new FileReader("A-input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("A-output.txt"));
        
        final int CASE_COUNT = sc.nextInt();
        for(int caseNum = 1; caseNum<= CASE_COUNT; caseNum++){
            pw.print("Case #" + caseNum + ": ");
            //HERE WE SOLVE STUFF
            int ans = 0;
            
            int N = sc.nextInt();
            int S = sc.nextInt();
            int sp = sc.nextInt();
            for(int i =0; i<N; i++){
                int score = sc.nextInt();
                int kk = score % 3;
                int base = (score - kk)/3;
                
                if(base >= sp){
                    ans++;
                } else if( kk > 0 && (base + 1) >= sp && (base - 1) >= 0){
                    ans++;
                } else if(S>0) {
                    if(kk == 0 && (base+2) >= sp && (base - 1) >= 0){
                        ans++;
                        S--;
                    }
                    if(kk == 1 && (base+2) >= sp && (base - 1) >= 0){
                        ans++;
                        S--;
                    }
                    if(kk == 2 && (base+2) >= sp){
                        ans++;
                        S--;
                    }
                }
                 
            }
            
            //PUT ANSWER HERE
            pw.println(ans);
        }
        
        pw.flush();
        pw.close();
        sc.close();
    }

    
}
