/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintStream;


public class Solver {
	
	protected final static String IN_FILE = "in";
	protected final static String OUT_FILE = "out";
	protected final static String OUT_PREFIX = "Case #$: ";
	protected BufferedReader in;
	protected int cases;
	
	
	public Solver() throws Throwable {
		File inFile = new File(IN_FILE);
		if (!inFile.exists()) {
			throw new RuntimeException();
		}
		in = new BufferedReader(new FileReader(inFile));
		cases = Integer.parseInt(in.readLine());
		
		
		File outFile = new File(OUT_FILE);
		if (outFile.exists()) {
			outFile.delete();
		}
		outFile.createNewFile();
		System.setOut(new PrintStream(outFile) );

		for (int i = 0; i < cases; i++) {
			ProblemCase c = new DancingGooglersProblemCase(in);
			System.out.println(OUT_PREFIX.replaceAll("[$]", (new Integer(i+1)).toString()) + c.getResult());
		}
	}
	
	public static void main(String[] args) throws Throwable {
		new Solver();
	}
}
