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

public class Dancing_With_the_Googlers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("input.in"));
		//BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		FileWriter fw = new FileWriter("output.txt");
		int t = Integer.parseInt(in.readLine());
		int num = 1;
		while (t-- > 0) {
			String[] a = in.readLine().split(" ");
			int n = Integer.parseInt(a[0]);
			int s = Integer.parseInt(a[1]);
			int p = Integer.parseInt(a[2]);
			Integer[] inp = new Integer[n];
			for (int i = 0; i < inp.length; i++) {
				inp[i] = Integer.parseInt(a[i + 3]);
			}
			Arrays.sort(inp);
			int c = 0;
			for (int i = 0; i < inp.length; i++) {
				int first = inp[i] / 3;
				int rem = inp[i] - first;
				int second = rem / 2;
				int third = rem - (rem / 2);

				if (first == second && second == third) {
					if (first >= p) {
						c++;
					} else if (s > 0 && first > 0 && first + 1 >= p) {
						c++;
						s--;
					}
				} else if (first == second && second == third - 1) {
					if (third >= p)
						c++;
				} else if (second == third) {
					if (third >= p) {
						c++;
					} else if (third > 0 && third + 1 >= p && s > 0) {
						c++;
						s--;
					}
				}
			}
			fw.write("Case #" + num++ + ": " + c + "\n");
		}
		fw.flush();
		fw.close();
	}
}
