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.IOException;
import java.io.PrintStream;
import java.util.Scanner;

// Qualification Round 2012
// Problem A

public class DancingWithTheGooglers {

	public static void main(String[] args) {
		Scanner sc = null;
		try {
			sc = new Scanner(new File("B-small.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		PrintStream output = null;

		try {
			output = new PrintStream(new File("B-small.out"));
		} catch (IOException e) {
			e.printStackTrace();
		}
		
		int[][] maxScores = new int[31][2];

		for(int i = 0; i < 31; i++){
			maxScores[i][0] = (int) Math.round((i + 1) / 3.0);
			if(i < 2 || i > 28)
				maxScores[i][1] = -1;
			else
				maxScores[i][1] = (int) Math.round((i + 3) / 3.0);
		}
		
		int cases = sc.nextInt();
		sc.nextLine();

		for(int c = 0; c < cases; c++){
			int googlers = sc.nextInt();
			int surprises = sc.nextInt();
			int p = sc.nextInt();

			int count = 0;

			for(int s = 1; s <= googlers; s++){
				int score = sc.nextInt();
				
				if(maxScores[score][0] >= p)
					count++;
				else if (maxScores[score][1] >= p && surprises > 0){
					count++;
					surprises--;
				}
			}

			System.out.printf("Case #%d: %s\n", c + 1, count);
			output.printf("Case #%d: %s\n", c + 1, count);
		}

	}
}