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

public class B {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
		String li;
		int tcn = Integer.parseInt(in.readLine());
		Scanner sc;
		int N, S, P;
		int[] scr;
		for (int tc = 0; tc < tcn; tc++) {
			li = in.readLine();
			sc = new Scanner(li);
			N = sc.nextInt(); S = sc.nextInt(); P = sc.nextInt();
			scr = new int[N];
			for (int i = 0; i < N; i++) {
				scr[i] = sc.nextInt();
			}
			
			Arrays.sort(scr);
			
			int result = 0;
			for (int i = scr.length - 1; i >=0; i--) {
				int tmp = scr[i] / 3;
				if (P - tmp >= 3 || (scr[i] == 0 && P > 0)) break;
				int r = scr[i] % 3;
				if (tmp >= P) {
					result++;
				} else {
					if (P - tmp == 1) {
						if (r > 0) {
							result++;
						} else {
							if (S > 0) {
								result++;
								S--;
							}
						}
					} else {
						if (P -tmp == 2) {
							if (r == 2 && S > 0) {
								result++;
								S--;
							}
						}
					}
				}
			}
			
			System.out.println("Case #" + (tc + 1) + ": " + result);
		}
		in.close();
	}

}
