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.*;

/**
 * User: Andrii Baranov
 * Date: 14.04.12
 * Time: 12:59
 */
public class DancingGooglers {

    public static void main(String args[]) throws IOException {
        BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));

        int testCases = Integer.parseInt(br.readLine());
        int[] maximumGooglers = new int[testCases];

        String paramString;
        int surprising, maxRes, googlersNumber;
        for (int i = 0; i < testCases; ++i) {
            paramString = br.readLine();
            String params[] = paramString.split(" ");

            googlersNumber = Integer.parseInt(params[0]);
            surprising = Integer.parseInt(params[1]);
            maxRes = Integer.parseInt(params[2]);

            int[] sumOfResults = new int[googlersNumber];
            for (int j = 0; j < googlersNumber; ++j) {
                sumOfResults[j] = Integer.parseInt(params[3 + j]);
            }

            maximumGooglers[i] = numOfBestResults(googlersNumber, surprising, maxRes, sumOfResults);
        }
        br.close();

        BufferedWriter bw = new BufferedWriter(new FileWriter("B-small-out.txt"));
        for (int i = 0; i < maximumGooglers.length; i++) {
            bw.write("Case #" + (i + 1) + ": " + maximumGooglers[i]);
            if (i + 1 < maximumGooglers.length) {
                bw.write("\n");
            }
        }
        bw.close();

    }

    private static int numOfBestResults(int googlersNumber, int surprising, int maxRes, int[] sumOfResults) {
        int res = 0;
        int transformSurprising = 0;

        if(maxRes == 0){
            return googlersNumber;
        }
        if(maxRes == 1){
            for(int i =0; i < googlersNumber; i++){
                if (sumOfResults[i]> 0){
                    res++;
                }
            }
            return res;
        }

        for (int i = 0; i < googlersNumber; ++i) {

            if ((sumOfResults[i] / 3 + 1) >= maxRes) {
                if ((sumOfResults[i] % 3 == 0) && ((sumOfResults[i] / 3 + 1) == maxRes)) {
                    transformSurprising++;
                    res++;
                } else {
                    res++;
                }

            } else if ((sumOfResults[i] % 3 == 2) && ((sumOfResults[i] / 3 + 2) == maxRes)) {
                transformSurprising++;
                res++;
            }
        }

        if (transformSurprising > surprising) {
            return res - (transformSurprising - surprising);
        }
        return res;
    }
}
