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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.StringTokenizer;

public class B {

    private B() {
    }

    public static void main(final String[] args) throws Exception {
        final B a = new B();
        a.solve();
    }

    public void solve() throws Exception {
        final BufferedReader in = new BufferedReader(new FileReader(new File("f.in")));
        System.setOut(new PrintStream(this.getClass().getSimpleName() + ".out"));
        // StringTokenizer st;
        final String line = in.readLine();
        final int test = Integer.parseInt(line);
        for (int q=1; q <= test;q++) {
            final StringTokenizer st = new StringTokenizer(in.readLine());

            final int N = Integer.parseInt(st.nextToken());
            final int S = Integer.parseInt(st.nextToken());
            final int p = Integer.parseInt(st.nextToken());
            final int[] mas = new int[N];
            for (int i = 0; i < N; i++) {
                mas[i] = Integer.parseInt(st.nextToken());
            }

            final int[][] result = new int[N][3];
            for (int i = 0; i < N; i++) {
                result[i][0] = (mas[i] + 2) / 3; // Normal
                if (mas[i] == 0) {
                    result[i][1] = 0;
                    continue;
                }
                final int div = mas[i] / 3;
                final int mod = mas[i] % 3;
                if (mod == 0) {
                    result[i][1] = div + 1; // Suprised
                } else if (mod == 1) {
                    result[i][1] = -1; // Suprised
                } else if (mod == 2) {
                    result[i][1] = div + 2; // Suprised
                }
                // result[i][0] = (mas[i]+2)/3; //bonus
            }

            int res = 0;
            int added = 0;

            for (int i = 0; i < N; i++) {
                if (result[i][0] >= p) {
                    res++;
                    continue;
                }
                if (result[i][1] >= p) {
                    added++;
                    continue;
                }
            }

            res = res + Math.min(added, S);
            System.out.println("Case #" + q + ": " + res);
        }
    }
}
