import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;


public class B {
	static int[][] memo;
	static int[] nums;
	static int p;
	public static void main(String[] args)throws IOException
	{
		Scanner br=new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out=new PrintWriter(new File("b.out"));
		int cases=br.nextInt();
		for(int c=1;c<=cases;c++)
		{
			int n=br.nextInt(),s=br.nextInt();
			p=br.nextInt();
			nums=new int[n];
			for(int i=0;i<n;i++)
				nums[i]=br.nextInt();
			memo=new int[n][s+1];
			for(int[] a:memo)
				Arrays.fill(a,-1);
			out.printf("Case #%d: %d\n",c,go(0,s));
		}
		out.close();
	}
	public static int go(int index,int s)
	{
		if(index>=nums.length)
			return 0;
		if(memo[index][s]!=-1)
			return memo[index][s];
		int best=0;
		for(int i=0;i<=10;i++)
		{
			int max=i;
			for(int j=0;j<=10;j++)
			{	
				if(Math.abs(i-j)>2)
					continue;
				max=Math.max(i,j);
				thisone:
				for(int k=0;k<=10;k++)
				{
					int ret=0;
					if(Math.abs(i-k)>2||Math.abs(j-k)>2)
						continue;
					max=Math.max(max,k);
					int count=0;
					if(Math.abs(i-k)==2)
						count++;
					if(Math.abs(i-j)==2)
						count++;
					if(Math.abs(j-k)==2)
						count++;
					if(i+j+k==nums[index])
					{
						boolean surp=(count>=1);
						if(surp&&s>0)
						{
							if(max>=p)
								ret++;
							ret+=go(index+1,s-1);
						}
						else if(!surp)
						{
							if(max>=p)
								ret++;
							ret+=go(index+1,s);
						}
						best=Math.max(best,ret);
					}
					else if(i+j+k>nums[index])
						break thisone;
				}
			}
		}
		return memo[index][s]=best;
	}
}

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();
    }
}
