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.*;
import java.util.StringTokenizer;
public class Dancing
{
	public static void main(String[] args)
	{
		    
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

		int tc,data[],result[],nog,sc,exno;
		int av,rem,count;
		String s,s1;
		StringTokenizer st;
		
		try
		{
			tc=Integer.parseInt(br.readLine());
			result=new int[tc];
			for(int i=0;i<tc;i++)
			{
				int j=0;
				s=br.readLine();
				st=new StringTokenizer(s," ");
				data=new int[st.countTokens()+1];

				while(st.hasMoreTokens())
				{
					s1=st.nextToken();
					data[j]=Integer.parseInt(s1);
					j++;
					
				}
				
				nog=data[0];
				sc=data[1];
				exno=data[2];
				count=0;
				for(int k=3;k<nog+3;k++)
				{
					
					
					av=data[k]/3;
					rem=(data[k])%3;

					if(av>=exno)
					{
						count++;
						continue;
					}
					
					if(rem==0&&sc!=0&&av+1>=exno&&data[k]>exno)
					{
						sc--;
						count++;
						continue;
					}

					if(rem==1&&(av+rem)>=exno)
					{
						count++;
						continue;
					}
					
					if(rem==2)
					{
						if(av+1>=exno)
						{
							count++;
							continue;
						}
						if(sc!=0&&av+2>=exno)
						{	
							count++;
							sc--;
						}
					}
					
						
				}
				
				result[i]=count;
				
				
			}
			
			for(int i=0;i<tc;i++)
				System.out.println("Case #"+(i+1)+": "+result[i]);			

		}
		catch(Exception e)
		{
			System.out.println(e.getMessage());
		}

	}
}