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.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;


public class problem2 {
	public static void main(String[] args){
		try{
			  // Create file 
			  FileWriter fstream1 = new FileWriter("E:/out.txt");
			  BufferedWriter outp = new BufferedWriter(fstream1);
		try{
		Scanner sc = new Scanner(new File("E:/B-small-attempt3.in"));
		int cnt1=sc.nextInt();
		cnt1=0;
	      while (sc.hasNextInt()) {
	    	  int ng = sc.nextInt();
	    	  int ns = sc.nextInt();
	    	  int p = sc.nextInt();
	    	  int cnt =0;
	    	  for(int i=0;i<ng;i++){
	    		  int gs = sc.nextInt();
	    		  if(gs==0){
	    			  if(p==0)
	    				  cnt++;
	    			  continue;
	    		  }
	    		  if(gs%3==0){
	    			  if(gs/3>=p){
	    				  cnt++;
	    			  }
	    			  else
	    				  if(gs/3+1==p){
	    					  if(ns>0){
	    						  cnt++;
	    						  ns--;
	    					  }
	    				  }
	    		  }
	    		  else
	    			  if(gs%3==1){
	    				  if(gs/3+1>=p)
	    					  cnt++;
	    			  }
	    			  else
	    				  if(gs/3+1>=p){
	    					  cnt++;
	    				  }
	    					  else{ 
	    						  if(gs/3+2==p){
	    							  if(ns>0){
	    								  cnt++;
	    								  ns--;
	    							  }
	    						  }
	    				  }
	    	  }
	    	 outp.write("Case #"+(cnt1+1)+": "+cnt+'\n');;
	    	 cnt1++;
	      }
		}catch(FileNotFoundException e){System.out.println("File not found");}
		outp.close();
		}catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
			  } 
	}
}
