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.util.*;
public class CodeJam2
{
	public static void main(String[] args) 
	{
		Scanner bc=new Scanner(System.in);
		int testCases=bc.nextInt();
		for(int i=0;i<testCases;i++)
		{	
			int count1=0;	
			int best=0;
			int n=bc.nextInt();
			int a1[]=new int[n];
			int surprise=bc.nextInt();
			int limit=bc.nextInt();
			for(int j=0;j<n;j++)
			{
				a1[j]=bc.nextInt();
			}
			for(int  q=0;q<n;q++)
			{
				/*System.out.println("The value of array is "+a1[q]);
				*/
			}
			int array1[][]=new int[n][3];
			for(int j=0;j<n;j++)
			{
				array1[j][0]=a1[j]/3;
				int t=a1[j]-array1[j][0];
				int data1=t/2;
				int data2=t-data1;
				if(a1[j]!=0)
				{
				if(data1-data2==0)
				{
					if(limit-data1==1)
					{
						if(count1<surprise)
						{
							count1++;
							best++;
							array1[j][1]=data1--;
							array1[j][2]=data2++;
						}
						else
						{
							array1[j][1]=data1;
							array1[j][2]=data2;
						}
					}
					else if (limit-data1==0)
					{
						array1[j][1]=data1;
						array1[j][2]=data2;
						best++;
					}
					else if(limit-data1>1)
					{
						array1[j][1]=data1;
						array1[j][2]=data2;
					}
					else if(limit-data1<0)
					{
						array1[j][1]=data1;
						array1[j][2]=data2;
						best++;
					}
				}
				
				else if((data2-data1)==1)
				{
					if(limit<=data2)
					{
						array1[j][1]=data1;
						array1[j][2]=data2;
						best++;
					}
					else 
					{
						array1[j][1]=data1;
						array1[j][2]=data2;
					}
				}
				}
				else{
					if(limit==0)
					{
						best++;
					}
				}
			}
			System.out.println("Case #"+(i+1)+": " +best);
		}

	}

}
