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

package com.google.codejam.googlers;

/**
 * Class to represent each test case.
 * It will hold details like test case no, input to be operated and TestResult.
 * @author Sushant Deshpande
 *
 */
public class TestCase {

    /**
     * Variable to hold value for test case number.
     */
    private int caseNo;

    /**
     * Variable to hold lower limit.
     */
    private int noOfGooglers;

    /**
     * Variable to hold upper limit.
     */
    private int noOfurprisingTriplets;

    /**
     * Variable to hold value of best result.
     */
    private int bestResult;

    /**
     * Array to hold googlers score.

     */
    private int [] scores;

    /**
     * Variable holding test case result.
     */
    private TestResult output;

    /**
     * Constructor for creating TestCase with case no.
     * @param caseNo int
     * @param noOfGooglers int
     * @param surprisingTriplets int
     */
    public TestCase(final int caseNo, final int noOfGooglers, final int surprisingTriplets,
                    final int bestResult, final int [] scores) {
        this.caseNo = caseNo;
        this.noOfGooglers = noOfGooglers;
        this.noOfurprisingTriplets = surprisingTriplets;
        this.bestResult = bestResult;
        this.scores = scores;
    }

    /**
     * Settter method for TestResult.
     * @param output TestResult
     */
    public final void setOutput(final TestResult output) {
        this.output = output;
    }

    public final int getNoOfurprisingTriplets() {
        return noOfurprisingTriplets;
    }

    public final int getNoOfGooglers() {
        return noOfGooglers;
    }

    /**
     * Getter method for best result.
     * @return int
     */
    public final int getBestResult() {
        return bestResult;
    }

    /**
     * Method for getting scores.
     * @return int []
     */
    public final int[] getScores() {
        return scores;
    }

    /**
     * Method to format the test output for printing in the report.
     * @return String formatted output for the given input.
     */
    public final String printTestResult() {
        StringBuilder resultBuilder = new StringBuilder("Case #");
        resultBuilder.append(caseNo).append(": ");
        resultBuilder.append(output.getTestOutput()).append("\n");
        return resultBuilder.toString();
    }
}