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 Dancing {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int caseCount = sc.nextInt();
		for (int i = 1; i <= caseCount; i++) {
			int N = sc.nextInt();
			int numSuprise = sc.nextInt();
			int p = sc.nextInt();
			int bestN = 0;
			for (int j = 1; j <= N; j++) {
				int result = getThree(sc.nextInt(), numSuprise, p);
				if (result > 1) {
					result = 1;
					numSuprise--;
				}
				bestN += result;
			}

			System.out.println("Case #" + i + ": " + bestN);
		}
	}

	private static int getThree(int total, int numSuprise, int p) {
		if (total == 0 && p > 0) {
			return 0;
		} else if ((total - p) < (p - 2) * 2) {
			return 0;
		} else if ((total - p) == (p - 2) * 2 || (total - p) == (p * 2 - 3)) {
			if (numSuprise <= 0) {
				return 0;
			} else {
				return 2;
			}
		} else {
			int average = total * 10 / 3;
			if (average % 10 == 0) {
				if (average >= p * 10) {
					return 1;
				} else {
					return 0;
				}
			} else if (average % 10 == 3) {
				if ((average + 7) >= p * 10) {
					return 1;
				} else {
					return 0;
				}
			} else {
				if ((average + 4) >= p * 10) {
					return 1;
				} else {
					return 0;
				}
			}
		}
	}
}
