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


	}
}
