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


public class Scores {
	private int N;	// Number of Googlers
	private int S; 	// Number of surprising triplets of scores
	private int p;	// Score at least 
	private int[] t; 	// total point of Googlers

	public Scores(String str) {
		String[] tmpArr = str.split(" "); 
		N = Integer.parseInt(tmpArr[0]); 
		S = Integer.parseInt(tmpArr[1]);
		p = Integer.parseInt(tmpArr[2]);
		
		t = new int[N];
		for (int i=0; i<N; i++) {
			t[i] = Integer.parseInt(tmpArr[i+3]);
		}
	}
	
	public int getMaxNumberOfGooglerOverScore() {
		int minTNormal = 3 * p -2 ;  // Normal : p, p-1, p-1
		int minTSurprising = 3 * p - 4 ; // surprising triplets : p, p-2, p-2
		
		if (p == 0) {
			return t.length; 
		} else if (p == 1) {
			minTSurprising = 3 * p -2 ; // p, p-1, p-1 
		}
		
		
		int maxNumber = 0 ; 		
		int surpNumber = 0 ; 
		for (int i=0; i<N; i++) {
			if (t[i] >= minTNormal) {
				maxNumber++ ; 
			} else if (t[i] >= minTSurprising) {
				surpNumber++ ; 
			}
	 	}
		
		if (S < surpNumber) {
			surpNumber = S ;
		}
		
		return maxNumber+surpNumber; 
	}

}
