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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancing.with.the.googlers;

/**
 *
 * @author Optee
 */
public class ScoreCounter {

    int numberOfGooglers;
    int surpriseCount;
    int minScore;
    int[] scores;

    public ScoreCounter(String line) {
        String[] numbers = line.split(" ");
        this.numberOfGooglers = Integer.valueOf(numbers[0]);
        this.surpriseCount = Integer.valueOf(numbers[1]);
        this.minScore = Integer.valueOf(numbers[2]);
        this.scores = new int[numbers.length-3];
        int j = 0;
        for (int i = 3; i < numbers.length; i++) {
            scores[j++] = Integer.valueOf(numbers[i]);
        }
    }
    
    int Count2() {
        int winners = 0;
        Integer surprise = surpriseCount;
        
        for (int i = 0; i < numberOfGooglers; i++) {
            int score = this.scores[i];
            int minCount = minScore * 3;
            if(score == 0 && minScore > 0) continue;
            if (score + 2 >= minCount) {
                winners++;
            }
            else if (score + 4 >= minCount && surprise > 0) {
                surprise--;
                winners++;
            }
        }
        return winners;
    }
    
    int Count() throws Exception {
        int winners = 0;
        Integer surprise = surpriseCount;
        Integer possibleSurprises = 0;
        
        for (int i = 0; i < numberOfGooglers; i++) {
            int score = this.scores[i];
            int tail = score - minScore;
            
            if (tail <= 0) continue;
            
            int divTileOne = tail/2;
            int divTileTwo = tail - divTileOne;
            
            if (Math.max(divTileOne, divTileTwo) >= minScore){
                if (Math.max(divTileOne, divTileTwo) - minScore >=2)
                    possibleSurprises++;
                winners++;
            }
            else if (minScore - Math.min(divTileOne, divTileTwo) < 2) {
                winners++;
            }
            else if (minScore - Math.min(divTileOne, divTileTwo) == 2) {
                if (surprise > 0) {
                    surprise--;
                    winners++;
                }
            }
        }            
        return winners;
    }
    
}
