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;
	}
}


/**
 * Name: Shivam99
 * email: shivthedestroyer99@gmail.com
 */

import java.io.*;

public class ProblemB
{
    public static void main(String[] args) throws IOException{
        FileReader fr=new FileReader(args[0]);
        BufferedReader br=new BufferedReader(fr);
        String str=br.readLine();
        int t=Integer.parseInt(str);
        String ss="";
        int c=1;
        while(c<=t){
            str=br.readLine();
            int n=0,s=0,p=0,surp=0,count=0,ans=0;
            int arr[]=new int[100];
            String word="";
            
            for(int ind=0;ind<str.length();ind++){
                char ch=str.charAt(ind);
                if(ch!=' ')
                    word+=ch;
                else{
                    count++;
                    int num=Integer.parseInt(word);
                    if(count==1){
                        n=num;
                        arr=new int[n];
                    }
                        else
                        if(count==2)
                            s=num;
                            else
                            if(count==3)
                                p=num;
                                else
                                arr[count-4]=num;
                    word="";              
                }
            }
            
            arr[count-3]=Integer.parseInt(word);
            int min=p+p+p-4;
            ss+="Case #"+c+": ";

            for(int ind=0;ind<arr.length;ind++){
                if(arr[ind]>=p && arr[ind]>=min)
                    ans++;
                if(arr[ind]==(min) || arr[ind]==(min+1))
                  if(arr[ind]>1)
                    surp++;
            }

           if(s<surp)
               ans=ans+s-surp;
           ss+=ans+"\n";
           c++;
        }
       System.out.print(ss);
       br.close();
       fr.close();
    }
}