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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.regex.Pattern;


public class ProblemB {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		try {
			Scanner input = new Scanner(new FileReader("B-small-attempt1.in"));
			PrintWriter output = new PrintWriter(new FileWriter("output2.txt"));

			int numberCases = input.nextInt();
			String data = input.nextLine();

			for (int i = 0; i < numberCases; i++) {
				output.print("Case #" + (i + 1) + ": ");

				data = input.nextLine();
				String[] intS = Pattern.compile(" ").split(data);
				int[] numbers = new int[intS.length];
				for (int j = 0; j < intS.length; j++) {
					numbers[j] = Integer.parseInt(intS[j]);
				}

				int numberGooglers = numbers[0];
				int surprising = numbers[1];
				int p = numbers[2];

				int count = 0;
				//System.out.print("N ");
				for (int j = 0; j < numberGooglers; j++) {
					if (((numbers[j + 3] / 3.0)) > (p - 1)) {
						//System.out.print(numbers[j + 3] + " ");
						count++;
					}
				}

				//System.out.print("S ");
				if (surprising > 0) {
					for (int j = 0; j < numberGooglers && surprising != 0; j++) {
						if ((numbers[j + 3] / 3.0) <= (p - 1) &&
								(numbers[j + 3] / 3.0) >= (p - 2)) {
							if (Math.floor(((numbers[j + 3] - p) / 2.0)) >= (p - 2) && 
									(numbers[j + 3] - p) >= 0) {
									//System.out.print(numbers[j + 3] + " ");
									count++;
									surprising--;
								}
						}
					}
				}
				//System.out.println("Counter " + count);
				output.print(count);
				output.print("\n");
			}
			output.flush();
			output.close();
			input.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

}