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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.Arrays;

import org.apache.commons.io.IOUtils;

public class Problem2 {
	public static void main(String[] args) throws NumberFormatException,
			IOException {
		// The first line of the input gives the number of test cases, T.
		BufferedReader in = null;
		try {
			in = new BufferedReader(new FileReader(args[0]));
			int T = Integer.parseInt(in.readLine());
			for (int i = 1; i <= T; i++) {
				String[] split = in.readLine().split(" ");
				// T test cases follow. Each test case consists of a single line
				// containing integers separated by single spaces. The first
				// integer will be N, the number of Googlers
				int N = Integer.parseInt(split[0]);
				// and the second integer will be S, the number of surprising
				// triplets of
				// scores.

				int S = Integer.parseInt(split[1]);
				// The third integer will be p, as described above.
				int p = Integer.parseInt(split[2]);
				// Next will be N integers ti: the total points of the Googlers.
				int[] ti = new int[N];
				for (int j = 0; j < ti.length; j++)
					ti[j] = Integer.parseInt(split[j + 3]);
//				System.out.println(String.format(
//						"N = %s S = %s p = %s ti = %s ", N, S, p,
//						Arrays.toString(ti)));
				int count = 0;
				for (int j = 0; j < ti.length; j++) {
					int t = ti[j];
					if (t < p)
						continue;
					if (t >= p * 3 - 2)
						count++;
					else if (t >= p * 3 - 4 && --S >= 0)
						count++;
				}
				System.out.println("Case #" + i + ": " + count);
			}
		} finally {
			IOUtils.closeQuietly(in);
		}
	}
}
