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 {
	private static boolean isValidScore(int score) {
		return score >=0 && score <= 10;
	}
	private static boolean canReach (int tot, int p, boolean canSurprise) {
		int n = tot / 3;
		int a,b,c;
		a = n;
		b = n;
		c = tot - a - b;
		int max = -1;
		if (a==c) {
			//a-1, a, a+1
			if (isValidScore(a-1) && isValidScore(a) && isValidScore(a+1) && canSurprise) {
				max = a+1;
			}
			//a, a, a
			else if (isValidScore(a)) max = a;
		}
		if (a+1 == c) {
			//a, a, a+1
			if (isValidScore(a) && isValidScore(a+1)) max = a+1;
		}
		if (a+2 == c) {
			//a, a, a+2
			if (isValidScore(a) && isValidScore(a+2) && canSurprise) max = a+2;
			//a, a+1, a+1
			else if (isValidScore(a) && isValidScore(a+1)) max = a+1;
		}
		return max >= p;
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int i=0; i < T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int numCanReach = 0;
			for (int j=0; j < N; j++) {
				int tot = in.nextInt();
				if (canReach(tot, p, false)) numCanReach++;
				else if (canReach(tot,p, true) && S != 0) {
					numCanReach++;
					S--;
				}
			}
			System.out.println("Case #"+(i+1)+": "+numCanReach);
		}
	}
}
