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

import java.util.ArrayList;

public class DanceScoreCase {

    private int dancers;
    private int surpriseScores;
    private int scoreThreshold;
    private ArrayList<Integer> scores;

    public DanceScoreCase(String scoreLine) {

        String[] integers = scoreLine.split(" ");
        if(integers.length < 4) {
            throw new IllegalArgumentException("Not enough strings");
        }

        dancers = new Integer(integers[0]);
        surpriseScores = new Integer(integers[1]);
        scoreThreshold = new Integer(integers[2]);
        scores = new ArrayList<Integer>();
        for(int i = 3; i < integers.length; i++) {
            scores.add(Integer.valueOf(integers[i]));
        }

    }

    public Integer maxDancersThatCouldPass() {
        int passesUnsurprising = 0;
        int passesSurprising = 0;
        ArrayList<Integer> couldNotPassUnsuprising = new ArrayList<Integer>();

        for(Integer score : scores) {
            if(canPassThresholdUnsurprising(score, scoreThreshold)) {
                passesUnsurprising++;
            } else if(canPassThresholdSurprising(score, scoreThreshold)) {
                passesSurprising++;
            }
        }

        return passesUnsurprising + Math.min(passesSurprising, surpriseScores);
    }


    public static boolean canPassThresholdUnsurprising(int score, int threshold) {
        int minScore = Math.max(0, threshold-1);
        return (score >= threshold + 2*minScore);
    }

    public static boolean canPassThresholdSurprising(int score, int threshold) {
        int minScore = Math.max(0, threshold-2);
        return (score >= threshold + 2*minScore);
    }

    public int getDancers() {
        return dancers;
    }

    public int getSurpriseScores() {
        return surpriseScores;
    }

    public int getScoreThreshold() {
        return scoreThreshold;
    }

    public ArrayList<Integer> getScores() {
        return scores;
    }
}
