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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Formatter;
import java.util.Scanner;


public class G2 {
	private static Scanner inp;
	private static Formatter out;
	private static int T = 0;
	private static int g = 0;
	private static int s = 0;
	private static int p = 0;
	private static int cnt = 0;
	private static int tmp = 0;
	
	public static void main(String[] args) {
		try {
			inp = new Scanner(new File("test.txt"));
		} catch (FileNotFoundException e) {
			System.out.println("File not found!");
		}
		try {
			out = new Formatter("out.txt");
		} catch (FileNotFoundException e) {
			System.out.println("File not found!");
		}
		T = inp.nextInt();
		inp.nextLine();
		for(int i = 0; i < T; i++) {
			out.format("Case #%d: ", i+1);
			cnt = 0;
			g = inp.nextInt();
			s = inp.nextInt();
			p = inp.nextInt();
			for(int j = 0; j < g; j++) {
				tmp = inp.nextInt();
				if(tmp >= p*3-2) {
					cnt++;
				} else if(tmp >= p*3-4 && s > 0 && tmp > 0){
					cnt++;
					s--;
				}
			}
			out.format("%d\r\n", cnt);
		}
		inp.close();
		out.close();
	}
}
