import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

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;
    }
}
