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.*;
import java.util.*;

public class Main implements Runnable {
    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintStream writer;

    Main() {
        reader = new BufferedReader(new InputStreamReader(System.in));
        tokenizer = new StringTokenizer("");
        writer = new PrintStream(new BufferedOutputStream(System.out));
    }

    public void run() {
        try {
            int testCount = nextInt();
            for (int test = 1; test <= testCount; ++ test) {
                int n = nextInt();
                int m = nextInt();
                int p = nextInt();
                boolean v[][][] = new boolean[31][2][2];
                for (int a = 0; a <= 10; ++ a) {
                    for (int b = a; b <= 10; ++ b) {
                        for (int c = 0; c <= 10; ++ c) {
                            if (c - a <= 2) {
                                v[a + b + c][c - a >= 2? 1: 0][c >= p? 1: 0] = true;
                            }
                        }
                    }
                }
                int dp[] = new int[m + 1];
                for (int j = 1; j <= m; ++ j) {
                    dp[j] = Integer.MIN_VALUE;
                }
                for (int i = 0; i < n; ++ i) {
                    int ti = nextInt();
                    int dp2[] = new int[m + 1];
                    for (int j = 0; j <= m; ++ j) {
                        dp2[j] = Integer.MIN_VALUE;
                        for (int x = 0; x < 2; ++ x) {
                            for (int y = 0; y < 2; ++ y) {
                                if (v[ti][x][y] && j >= x) {
                                    dp2[j] = Math.max(dp2[j], dp[j - x] + y);
                                }
                            }
                        }
                    }
                    dp = dp2;
                }
                System.out.printf("Case #%d: %d\n", test, dp[m]);
            }
        } catch (Exception e) {
        }
    }

    String nextToken() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public static void main(String args[]) {
        new Thread(new Main()).run();
    }
}
