import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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;
	}
}
