package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}


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