import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.io.BufferedReader;
import java.io.InputStreamReader;

class DWtG {
    public static BufferedReader br = null;
    public static int numCases;
    public static int numDancers;
    public static int numSurprises;
    public static int p; // p is given by the problem as the "best score"
    public static String[] input;

    public static void main(String[] args) {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));

            numCases = Integer.parseInt(br.readLine().trim());

            for(int i = 0; i < numCases; i++) {
                input = br.readLine().split(" ");
                numDancers = Integer.parseInt(input[0]);
                numSurprises = Integer.parseInt(input[1]);
                p = Integer.parseInt(input[2]);
                int maxDancers = 0;

                for(int j = 3; j < input.length; j++) {
                    if(maxReg(Integer.parseInt(input[j])) >= p)
                        maxDancers++;
                    else if(numSurprises > 0 && maxSpecial(Integer.parseInt(input[j])) >= p) {
                        maxDancers++;
                        numSurprises--;
                    }
                }
                System.out.println("Case #" + (i+1) + ": " + maxDancers);
            }
        }
        catch(Exception e) {
            e.getMessage();
            e.printStackTrace();
        }
    }

    public static int maxReg(int n) {
        if(n == 0)
            return 0;
        else if(n == 1)
            return 1;
        else if(n == 2)
            return 1;
        else if(n % 3 == 0)
            return (n / 3);
        else if(n % 3 == 1)
            return (n / 3) + 1;
        else if(n % 3 == 2)
            return (n / 3) + 1;
        return -1;
    }

    public static int maxSpecial(int n) {
        if(n == 0)
            return 0;
        else if(n == 1)
            return 1;
        else if(n == 2)
            return 2;
        else if(n % 3 == 0)
            return (n / 3) + 1;
        else if(n % 3 == 1)
            return (n / 3) + 1;
        else if(n % 3 == 2)
            return (n / 3) + 2;
        return -1;
    }
}
