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.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author dave
 */
public class Main {

    public static void main(String g[]) {
        char map[] = new char[300];

        Scanner sc = new Scanner(System.in);
        int t = Integer.parseInt(sc.next());
        int k = 1;
        while (t > 0) {
            t--;
            int n = Integer.parseInt(sc.next());

            int s = Integer.parseInt(sc.next());
            int b = Integer.parseInt(sc.next());
            int list[] = new int[35]; // scores

            int initialCount = 0;

            int i = 0; // googler index
            while (n > 0) {
                n--;
                int score = Integer.parseInt(sc.next());
                int minVal = b + 2 * (b - 2);
                if(minVal<0)
                    minVal=b;
                int specialNumber = (3 * b - 3);
                if(specialNumber<0)
                {
                    specialNumber=0;
                    
                }
                
                //System.out.println("score = "+score);
                //System.out.println("minVal = "+minVal);
                if (score < minVal) 
                {
                    //System.out.println("SKIP");
                    continue;
                }

                initialCount++;

                if (score <= specialNumber  ) {
                    if (s > 0 && score>=2 && score<=28) {
                        //System.out.println("using special for :" + score);
                        s--;
                    } 
                    else 
                    {
                        //System.out.println("required but cannot use!");
                        initialCount--;
                    }
                    
                    if(score<2)
                        initialCount++;
                }



            }


            System.out.println("Case #" + (k++) + ": " + initialCount);

        }

    }
}
