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 {

    static int[][] dp; // dp[i][j]: iäººç®ã¾ã§çµãã£ãã»ãã¨jåsurprize
    static void solve(int casee, Scanner sc) {
        int n = sc.nextInt();
        int s = sc.nextInt();
        int p = sc.nextInt();
        int[] t = new int[n];
        for (int i = 0; i < n; i++) {
            t[i] = sc.nextInt();
        }
        dp = new int[n+1][s+1];
        for (int i = 0; i < n; i++) {
            boolean alwaysGood = (t[i] + 2) / 3 >= p;
            boolean goodWhenSurprizing = p == 0 || t[i] >= 2 && (t[i] + 4) / 3 >= p;
            if (alwaysGood) {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j] + 1;
                }
            }
            else if (goodWhenSurprizing) {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j];
                }
                for (int j = s; j >= 1; j--) {
                    dp[i+1][j-1] = Math.max(dp[i+1][j-1], dp[i][j] + 1);
                }
            }
            else {
                for (int j = s; j >= 0; j--) {
                    dp[i+1][j] = dp[i][j];
                }
            }
        }
        int max = 0;
        for (int i = 0; i <= s; i++) {
            max = Math.max(max, dp[n][i]);
        }
        System.out.println("Case #" + (casee+1) + ": " + max);
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 0; i < t; i++) {
            solve(i, sc);
        }
        
    }

}
