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;

public class B {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int t = scan.nextInt();
		for (int i = 1; i <= t; ++ i) {
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			int[] max = new int[n];
			for (int j = 0; j < n; ++ j) {
				max[j] = scan.nextInt();
			}
			boolean[] surprising = new boolean[n];
			for (int j = 0; j < s; ++ j) {
				surprising[j] = true;
			}
			int out = 0;
			do {
				out = Math.max(out, solve(max, surprising, p));
				surprising = next(surprising, surprising.length);
			} while (surprising != null);
			System.out.printf("Case #%d: %d\n", i, out);
		}
	}

	private static boolean[] next(boolean[] old, int end) {
		int index = 0;
		for (index = end - 1; index >= 0; -- index) {
			if (old[index]) {
				break;
			}
		}
		if (index == -1) {
			return null;
		}
		if (index == end - 1) {
			boolean[] ret = next(old, index);
			if (ret == null) {
				return null;
			}
			ret[index] = false;
			for (index = index - 1; index >= 0; -- index) {
				if (ret[index]) {
					break;
				}
			}
			ret[index + 1] = true;
			return ret;
		}
		old[index] = false;
		old[index + 1] = true;
		return old;
	}

	public static int solve(int[] max, boolean[] surprising, int p) {
		int ret = 0;
		for (int i = 0; i < max.length; ++ i) {
			if (surprising[i]) {
				if (max[i] < 2) {
					return 0;	// impossible
				}
				if (max[i] % 3 <= 1) {
					if (max[i] / 3 + 1 >= p) {
						ret ++;
					}
				} else {
					if (max[i] / 3 + 2 >= p) {
						ret ++;
					}
				}
			} else {
				if ((int)Math.ceil(max[i] / 3.0) >= p) {
					ret ++;
				}
			}
		}
		return ret;
	}
}
