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.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();
    }
}
