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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package IO;

/**
 *
 * @author dannocz
 */
public class TestCase {
    
    private int noGooglers;
    private int p;
    private Googler[] googlers;

    public TestCase(String testCase) {
        String[] cads=testCase.split(" ");
        noGooglers = Integer.parseInt(cads[0]);
        int surprisedCases = Integer.parseInt(cads[1]);
        p = Integer.parseInt(cads[2]);
        googlers= new Googler[noGooglers];
        
        for (int i = 0; i < noGooglers; i++) {
            int score=Integer.parseInt(cads[i+3]);
            googlers[i]=new Googler(score, surprisedCases);
            buildTripplets(googlers[i]);
        }
        
    }

    
    public TestCase(int noGooglers, int surprisedCases, int p) {
        this.noGooglers = noGooglers;
        this.p = p;
        this.googlers= new Googler[noGooglers];
    }
    
   
    
    public int result(){
        int total=0;
        for (Googler googler : googlers) {
            if(googler.result(p))
                total++;
        }
        
        return total;
    }

    private void buildTripplets(Googler googler) {
        
        int score = googler.getScore();        
        for(int hp = p; hp<=10; hp++)
        {
            int x= score-hp;
            for(int y1=0;y1<=hp;y1++){
            //for(int y1=hp;y1>=hp-2;y1--){
                int y2 = x-y1;
                if(validTripplet(score,hp,y1,y2))
                    googler.addTriplet(new Triplet(hp,y1,y2));
            }
        }               
    }

    private boolean validTripplet(int score,int hp, int y1, int y2) {
        
        return (hp+y1+y2)==score &&
                validPair(hp,y1) && validPair(hp,y2) && validPair(y1,y2);
        
    }
    
    private boolean validPair(int y1, int y2){
          
        if(y1<0 || y2<0 || y1>10 || y2>10)
            return false;
        
        int r= y1-y2;
        return (r<=2 && r>=-2);
    }
}