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 gcj2012.Pre;

import java.util.Scanner;

public class B {

	static Scanner sc = new Scanner(System.in);
	public static void main(String[] a){
				
		long numCases = Long.parseLong(sc.nextLine());
		for(long kase = 0 ; kase < numCases ; kase++){
			String[] ss = sc.nextLine().split(" ");
			int n = Integer.parseInt(ss[0]);
			int s = Integer.parseInt(ss[1]);
			int p = Integer.parseInt(ss[2]);
			int[] scores= new int[n];
			for(int i = 0 ; i < n ; i++)
				scores[i] = Integer.parseInt(ss[3+i]);			
			
			int ret = 0;
			if(p == 0){
				ret = n;
			}else if(p == 1){
				for(Integer i : scores){
					if(i > 0){
						ret++;
					}
				}				
			}else{
				int canCntSurNotNeed = 0;
				int canCntSurNeed = 0;
				int canSurOnly = 0;
				int canCntOnly = 0;
				for(int i = 0 ; i < n ; i++){
					if(scores[i] > 28){
						canCntOnly++;
					}else if(scores[i] >= p+p-1+p-1){
						canCntSurNotNeed++;
					}else if(scores[i] >= p+p-2+p-2){	
						canCntSurNeed++;
					}else if(scores[i] >= 2){
						canSurOnly++;
					}
				}
				if(s <= canCntSurNeed){
					ret = canCntOnly + canCntSurNotNeed + s;
				}else{
					ret = canCntOnly + canCntSurNotNeed + canCntSurNeed;
				}
			}
			
			System.out.println("Case #" + (kase+1) + ": " + ret);
		}
	}
		
}
