/*
 * 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.util.Scanner;
import java.util.ArrayList;

public class dancing {
	public static void main(String [] args){
		Scanner Keyboard = new Scanner(System.in);
		int testCases;
		ArrayList<String> input = new ArrayList<String>();
		ArrayList<Integer> totalPoints = new ArrayList<Integer>();
		int whitespaceNumber = 1;
		int previousWhitespace = 0;
		int numberOfGooglers = 0;
		int surprisingTriplet = 0;
		int bestResult = 0;
		int k = 0;
		int [] triplet = {0, 0, 0};
		int numberOfBestResults = 0;

		testCases = Keyboard.nextInt();
		Keyboard.nextLine();

		for (int i = 0; i < testCases; i++){
			input.add(Keyboard.nextLine());
		}

		for (int i = 0; i < testCases; i++){
			for (int j = 0; j < input.get(i).length(); j++){
				if (input.get(i).charAt(j) == ' '){
					if (whitespaceNumber == 1){
						numberOfGooglers = Integer.parseInt(input.get(i).substring(0, j));
						whitespaceNumber++;
						previousWhitespace = j;
					}
					else if (whitespaceNumber == 2){
						surprisingTriplet = Integer.parseInt(input.get(i).substring(previousWhitespace+1, j));
						whitespaceNumber++;
						previousWhitespace = j;
					}
					else if (whitespaceNumber == 3){
						bestResult = Integer.parseInt(input.get(i).substring(previousWhitespace+1, j));
						whitespaceNumber++;
						previousWhitespace = j;
					}
					else if (whitespaceNumber >= 4){
						totalPoints.add(Integer.parseInt(input.get(i).substring(previousWhitespace+1, j)));
						whitespaceNumber++;
						previousWhitespace = j;
					}
				}
			}
			totalPoints.add(Integer.parseInt(input.get(i).substring(previousWhitespace+1, input.get(i).length())));

			for (int b = 0; b < numberOfGooglers; b++){
				while(true){
					if (k + k + k < totalPoints.get(b)){
						k++;
					}
					else if (k + k + k > totalPoints.get(b)){
						if (k + k + (k-1) == totalPoints.get(b)){
							triplet[0] = k;
							triplet[1] = k;
							triplet[2] = k-1;
							break;
						}
						else if (k + (k-1) + (k-1) == totalPoints.get(b)){
							triplet[0] = k;
							triplet[1] = k-1;
							triplet[2] = k-1;
							break;
						}
					}
					else if (k + k + k == totalPoints.get(b)){
						triplet[0] = k;
						triplet[1] = k;
						triplet[2] = k;
						break;
					}
				}
				if (triplet[0] < bestResult && triplet[1] < bestResult && triplet[2] < bestResult && surprisingTriplet > 0){
					while (k < bestResult){
						k++;
					}
					if (k + k + (k-2) == totalPoints.get(b) && k >= bestResult && (k-2)>=0){
						triplet[0] = k;
						triplet[1] = k;
						triplet[2] = k-2;
						surprisingTriplet--;
					}
					else if (k + (k-1) + (k-2) == totalPoints.get(b) && k >= bestResult && (k-2)>=0){
						triplet[0] = k;
						triplet[1] = k-1;
						triplet[2] = k-2;
						surprisingTriplet--;
					}
					else if (k + (k-2) + (k-2) == totalPoints.get(b) && k >= bestResult && (k-2)>=0){
						triplet[0] = k;
						triplet[1] = k-2;
						triplet[2] = k-2;
						surprisingTriplet--;
					}
				}

				if (triplet[0] >= bestResult || triplet[1] >= bestResult || triplet[2] >= bestResult){
					numberOfBestResults++;
				}
				k = 0;
			}

			System.out.println("Case #" + (i+1) + ": " + numberOfBestResults);

			whitespaceNumber = 1;
			previousWhitespace = 0;
			numberOfGooglers = 0;
			surprisingTriplet = 0;
			bestResult = 0;
			numberOfBestResults = 0;
			totalPoints.clear();
		}


	}
}
