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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author Chung Lee
 */
public class DanceGoogler {

    public static void Main(String[] args) throws FileNotFoundException {

        Scanner scanner = new Scanner(new File(args[0]));
        PrintWriter writer = new PrintWriter(args[1]);

        int noCase = scanner.nextInt();

        for (int i = 0; i < noCase; i++) {
            int noGooglers = scanner.nextInt();
            int noSurprice = scanner.nextInt();
            int P = scanner.nextInt();

            List<Integer> totalScore = new ArrayList<Integer>();
            List<Integer> noSurpriceBest = new ArrayList<Integer>();
            for (int j = 0; j < noGooglers; j++) {
                int total = scanner.nextInt();
                totalScore.add(total);
                noSurpriceBest.add((int) Math.ceil(total / 3.));
            }
            
            int noAtLeastP = 0;

            for (int j = 0; j < totalScore.size(); j++) {
                if (noSurpriceBest.get(j) >= P) {
                    noAtLeastP++;
                } else if ((totalScore.get(j) % 3 == 0 || totalScore.get(j) % 3 == 2)
                        && totalScore.get(j) != 0
                        && totalScore.get(j) <= 27
                        && noSurpriceBest.get(j) == P - 1
                        && noSurprice > 0) {
                    noSurprice--;
                    noAtLeastP++;
                }
            }
            
            System.out.print(String.format("Case #%d: %d", i + 1, noAtLeastP));
            writer.print(String.format("Case #%d: %d", i + 1, noAtLeastP));
            
            if (i != noCase - 1) {
                System.out.println();
                writer.println();
            }

        }

        writer.close();
    }
}
