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

package dancing_with_googlers;

import java.io.IOException;
import java.util.ArrayList;

public class FindNumber {
	
	public static Integer start (String casus) {
        
        String[] splitInput = casus.split(" ");
        
        ArrayList<Integer> intinput = new ArrayList<Integer>();
        for (String s: splitInput) {
        	intinput.add(Integer.parseInt(s));
        	System.out.print(s + " ");
        }
        System.out.println();
        
        int nr=0;
        
        int googlers = intinput.get(0);
        int surprise = intinput.get(1);
        int p = intinput.get(2);
        
        for(int i=0; i<3; i++) {
        	intinput.remove(0);
        }
        
        for(int i=0; i<googlers; i++) {
        	boolean passtest = false;
        	System.out.println("Working on digit " + intinput.get(i) + " with surprise " + surprise + " and test " + p);
        	
        	if (p==0) {
        		passtest = true;
        		System.out.println("test was set to 0");
        	} else if (intinput.get(i)>0) {
        		if ((intinput.get(i)/3)>=p) {
        			passtest=true;
        			System.out.println("Integer " + intinput.get(i) + " was devided by three and the result was bigger or equal to " + p);
        		}
        		else if (((intinput.get(i)-p)/2)>=(p-1)){
        			passtest=true;
        			System.out.println("Integer " + intinput.get(i) + " was deminished by " + p + " and the result was devided by two. The result of this was bigger or equal to " + (p-1));
        		}
        		else if (((intinput.get(i)-p)/2)>=(p-2)&&surprise>0) {
        			passtest=true;
        			surprise--;
        			System.out.println("Integer " + intinput.get(i) + " was deminished by " + p + " and the result was devided by two. The result of this was bigger or equal to " + (p-2) + " and we still had some surprises left.");
        		}
        	}
        	if (passtest) nr++;
    		System.out.println(" nr is now set to " + nr);
        }
        
		return nr;
	}
}
