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 codejam2012.qr.dancing;

import java.util.concurrent.atomic.AtomicInteger;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author fedez
 */
public class DancerSolver
{

    private static Logger logger = Logger.getLogger(DancerSolver.class.getName());

    public static int solve(int googlers, int[] scores, int suprises, int scoreTopass)
    {
        AtomicInteger surprisesLeft;
        int numberOfPasses = 0;
        int score, i, possible;

        surprisesLeft = new AtomicInteger(suprises);
        for (i = 0; i < googlers; i++)
        {
            score = scores[i];
            possible = isItPossible(score, surprisesLeft, scoreTopass);
            logger.log(Level.INFO, "Score:{0}, surprisesLeft:{1}, scoreTopass:{2}, result:{3}", new Object[]
                    {
                        score, surprisesLeft, scoreTopass, possible
                    });

            numberOfPasses += possible;
        }

        return numberOfPasses;
    }

    private static int isItPossible(double score, AtomicInteger surprisesLeft, int scoreTopass)
    {
        double remainder, leftValues, lowestValue;

        if (scoreTopass == 0)
        {
            return 1;
        }

        remainder = score - scoreTopass;
        if (remainder < 0)
        {
            return 0;
        }
        
        leftValues = remainder / 2d;
        if (remainder % 2 == 0)
        {
            lowestValue = leftValues;
        }
        else
        {
            lowestValue = Math.floor(leftValues);
        }
        if (scoreTopass - lowestValue <= 1)
        {
            return 1;
        }
        else if (scoreTopass - lowestValue <= 2 && surprisesLeft.get() > 0)
        {
            surprisesLeft.decrementAndGet();
            return 1;
        }
        else
        {
            return 0;
        }
    }
}
