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 ProblemB {
	static Scanner in = new Scanner(System.in);
	
	public static void main(String[] args) throws Exception{
		int lineCount = Integer.valueOf(in.nextLine());
		int[] lines = new int[lineCount];
		
		for(int n = 0; n < lineCount; n++) {
			int N = in.nextInt(), 
				S = in.nextInt(), 
				p = in.nextInt();
			
			int max = 0;
			
			for (int i = 0; i < N; i++) {
				int score= in.nextInt();
				int single = score / 3;
				
				switch (score % 3) {
				case 0:
					if (single >= p) {
						max++;
					} else {
						if (S > 0 && score >= 2 && score <= 28 && single + 1 >= p) {
							max++;
							S--;
						}
					}
					break;
				case 1:
					if (single + 1 >= p) {
						max++;
					}
					break;
				case 2:
					if (single +1 >= p) {
						max++;
					} else {
						if (S > 0 && score >= 2 && score <= 28 && single + 2 >= p) {
							max++;
							S--;
						}
					}
				}
			}
			
			lines[n] = max;
			
			in.nextLine();
		}
		
		for(int i = 1; i <= lineCount; i++) {
			System.out.println("Case #" + i + ": " + lines[i-1]);
		}
	}
}