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

/*
 * Gabriel Shaw
 * 4/13/12
 */
import java.io.File;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.Scanner;
public class DancingWithTheGooglers 
{
    public static void main(String[] args) throws IOException
    {
        File file = new File("B-small-attempt1.in");
        PrintWriter outfile = new PrintWriter("B-small.out");
        Scanner infile = new Scanner(file);
        int numberOfCases;
        int numberOfGooglers;
        int desiredScore;
        int numberOfSuprisingCases;
        int numberOfGoodScores;
        numberOfCases = infile.nextInt();
        infile.nextLine();
        
        for(int i=0 ; i<numberOfCases ; i++)
        {
            numberOfGooglers = infile.nextInt();
            numberOfSuprisingCases = infile.nextInt();
            desiredScore = infile.nextInt();
            numberOfGoodScores = 0;
            for(int j=0 ; j<numberOfGooglers ; j++)
            {
                int totalScore = infile.nextInt();
                System.out.println(j +" " +(totalScore - desiredScore - (desiredScore - 1) - (desiredScore - 1)));
                if(desiredScore <= 1)
                {
                    if(desiredScore == 1)
                    {
                        if(totalScore - desiredScore >= 0)
                        {
                            numberOfGoodScores++;
                        }//end of if(totalScore - desiredScore >= 0)
                    }//end of if(desiredScore == 1)
                    if(desiredScore == 0)
                    {
                        if(totalScore >= 0)
                        {
                            numberOfGoodScores++;
                        }
                    }
                }
                if(!(desiredScore <= 1) && (totalScore - desiredScore - (desiredScore - 1) - (desiredScore - 1)) >= 0)
                {
                    numberOfGoodScores++;
                }else
                {
                    if(!(desiredScore <= 1) && (numberOfSuprisingCases > 0) && (totalScore -desiredScore - (desiredScore - 2) - (desiredScore - 2)) >= 0)
                    {
                        numberOfGoodScores++;
                        numberOfSuprisingCases--;
                    }//end of if((numberOfSuprisingCases > 0) && (totalScore -desiredScore - 2*(desiredScore - 2)) >= 0)
                }//end of else
            }//end of for(int j=0 ; j<numberOfGooglers ; j++)
            outfile.println("Case #" +(i+1) +": " +numberOfGoodScores);
            if(infile.hasNext())
            {
                infile.nextLine();
            }
        }//end of for(int i=0 ; i<numberOfCases ; i++)
        outfile.close();
    }//end of public static void main(String[] args) throws IOException
}//end of public class DancingWithTheGooglers 
