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.*;
/**
 *
 * @author ankush
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args)throws IOException {
        //System.out.println(Math.floor(Math.log10(11)));
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int t=Integer.parseInt(br.readLine());
        int ans[]=new int[t];
        for(int i=0;i<t;i++)
        {
            String x=br.readLine();
            String r[]=new String[250];
            r=x.split(" ");
            int n=Integer.parseInt(r[0]);
            int s=Integer.parseInt(r[1]);
             int p=Integer.parseInt(r[2]);
            int count=0;
            int arr[]=new int[n];
            for(int j=0;j<n;j++)
            {
                arr[j]=Integer.parseInt(r[j+3]);
            }
            int pos[]=new int[n];
            for(int j=0;j<n;j++)
            {
                int max=0,a=0,b=0,c=0;
                for(a=p;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)<2 && Math.abs(a-c)<2 && Math.abs(c-b)<2)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && pos[j]!=1)
                           {
                               count++;
                               pos[j]=1;
                           //  System.out.println(arr[j]+" "+a+" "+b+" "+c);
                             a=100;b=100;
                            break;
                           }
                        }
                     }
                }
                if(a==11)
                {
                for(a=p;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)<3 && Math.abs(a-c)<3 && Math.abs(c-b)<3)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && s>0 && pos[j]!=1)
                           {
                               s--;
                               count++;
                               pos[j]=1;
                             // System.out.println(arr[j]+" "+a+" "+b+" "+c+" "+s);
                             a=11;b=11;
                             break;
                           }
                        }
                    }
                }
                }

            }/*
              if(s>0)
                {
              for(int j=0;j<n;j++)
                {
                  if(pos[j]==1)
                  {
                 int max=0,a=0,b=0,c=0;
                for(a=0;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)==2 || Math.abs(a-c)==2 || Math.abs(c-b)==2)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && pos[j]==1)
                           {
                               s--;
                            //  System.out.println(arr[j]+" "+a+" "+b+" "+c);
                             a=100;b=100;
                             break;
                           }
                        }
                     }
                }
                    }
                }
              }*/
            ans[i]=count;
           //System.out.println(x+" "+ans[i]+" "+s);
            
    }
 for(int i=0;i<t;i++)
        {
            System.out.println("Case #"+(i+1)+": "+ans[i]);
        }
}
}