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 dg.gcj.bdancing;

import java.lang.reflect.Array;
import java.util.Arrays;

/**
* Created by IntelliJ IDEA.
* User: Dmitry
* Date: 15.04.12
* Time: 0:03
* To change this template use File | Settings | File Templates.
*/
public class Triplet
{
    int[] sorted;

    public Triplet(int[] sorted) {
        this.sorted = Arrays.copyOf(sorted, sorted.length);
    }

    public int getTotal() {
        return sorted[0] + sorted[1] + sorted[2];
    }

    public boolean isSurprising()
    {
        return this.sorted[2] - this.sorted[1] > 1 || this.sorted[1] - this.sorted[0] > 1 || this.sorted[2] - this.sorted[0] > 1;
    }

    public int getMaximumScore() {
        return sorted[2];
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;

        Triplet triplet = (Triplet) o;

        return Arrays.equals(sorted, triplet.sorted);
    }

    @Override
    public int hashCode() {
        return Arrays.hashCode(this.sorted);
    }

    @Override
    public String toString() {
        return "{" +  this.sorted[2] +
                ", " + this.sorted[1] +
                ", " + this.sorted[0] +
                '}';
    }
}
