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 q2
{
	public static int spl,threshold,players,output;
	public static void main(String []args) throws IOException
	{
		
		 PrintWriter pw=new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	   BufferedReader br=new BufferedReader(new FileReader("input.txt"));
		
		int arr[]=new int[107];
		 int limit=Integer.parseInt(br.readLine());
		 String x1;
		 String word="";
		 for(int li=1;li<=limit;li++)
	   {
	   	   x1=br.readLine();
	   	  int j=0;
	   	   StringTokenizer st =new StringTokenizer(x1);
	   	   while (st.hasMoreElements()) {

              String token = st.nextElement().toString();
               arr[j]=Integer.parseInt(token);
                 j++;
           }
            
            spl=arr[1];
            threshold=arr[2];
            players=arr[0];  
	   	    output=find(arr);
	        pw.println("Case #"+li+": "+output);
	   arr=new int[107];
	   }
	    pw.close();
  }
	
	public static int find(int arr[])
	{
		int a=0,b=0,c=0;
		int op=0;	
		for(int i=3;i<(players+3);i++)
		{
		   int num=arr[i];
		   int num2=num;
		   boolean check=true;
	  	a=num/3;
	     b=a;
		c=a;
		int diff=num2-(a*3);
			
		if(diff==0)
		{   if(a>=threshold||b>=threshold||c>=threshold)
	 	      op++;
	 	else
	 	 { 	 	
	 	 	if(spl>0)
	 	 	{
	 	 	 	if((a-1)>0)
	 	      	{
	 	 	 	 	if((a-1)>=threshold||b>=threshold||(c+1)>=threshold)
	 	             {
	 	             	  op++;
	 	                   spl--;
	 	              }
	 	         }
	 	      }
	 	   }
	 	 
		 }
		
		 if(diff==1)
		 { 	 if((a+1)>=threshold||b>=threshold||c>=threshold)
	 	       {      op++;
	 	        }
	 	       
	 	       else
	 	 { 	 	
	 	 	if(spl>0)
	 	 	{
	 	 	  	 	if((a+1)>=threshold||(b-1)>=threshold||(c+1)>=threshold)
	 	             {
	 	             	  op++;
	 	                   spl--;
	 	              }
	 	         
	 	      }
	 	   } 
	 	        
	 	 }
	     if(diff==2)
	     {	 
	 	      if((a+1)>=threshold||(b+1)>=threshold||c>=threshold){
	 	  	 op++;
	 	 }
	 	 else
	 	 { 	if(spl>0)
	 	 	{
	 	 	   if((a+2)>=threshold||b>=threshold||c>=threshold)
	 	        { 
	 	          op++;
	 	           spl--;
	 	      }
	 	   }
	 	 }
	 	 
	 	 }
	 	 }
	     
	    return op;
	}
}