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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

public class CodeJam2012Q2 {
	public static void main(String [] args){
		final String FILE_NAME="B-small-attempt0.in";
		StringTokenizer st;
		
		//IOUsage Variables
		String lineIn="";
		int numCases=0;
		
		//Index Variables
		
		//Contest Vars
		int numGooglers = 0;
		int numSurprising = 0;
		int atLeastResult = 0;
		int[] googlerScores;
		
		int numGP = 0;
		
		try
		{
			BufferedReader br = new BufferedReader(new FileReader(FILE_NAME));
			lineIn = br.readLine();
			numCases = Integer.parseInt(lineIn);
			for(int i=0; i<numCases; i++)
			{
				lineIn = br.readLine();
				st = new StringTokenizer(lineIn);
				numGooglers = Integer.parseInt(st.nextToken());
				numSurprising = Integer.parseInt(st.nextToken());
				atLeastResult = Integer.parseInt(st.nextToken());
				googlerScores = new int[numGooglers];
				
				for(int j=0; j<numGooglers; j++)
				{
					googlerScores[j] = Integer.parseInt(st.nextToken());
				}
				
				for(int j=0; j<numGooglers; j++)
				{
					if(googlerScores[j]==0)
					{
						if(atLeastResult==0)
						{
							numGP++;
						}
					}
					else if(googlerScores[j]==1)
					{
						if(atLeastResult==0 || atLeastResult==1)
						{
							numGP++;
						}
					}
					else if(googlerScores[j]==2)
					{
						if(atLeastResult==0 || atLeastResult==1)
						{
							numGP++;
						}
						else if(atLeastResult==2)
						{
							if(numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
					}
					else
					{
						if((googlerScores[j] % 3) == 0)
						{
							if((googlerScores[j]/3) - atLeastResult > -1 )
							{
								numGP++;
							}
							else if((((googlerScores[j]/3) - atLeastResult) == -1) && numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
						else if((googlerScores[j] % 3) == 1)
						{
							if (((googlerScores[j]/3)+1) - atLeastResult >= 0)
							{
								numGP++;
							}
						}
						else if((googlerScores[j] % 3) == 2)
						{
							if((googlerScores[j]/3) - atLeastResult + 1 > -1 )
							{
								numGP++;
							}
							else if((((googlerScores[j]/3) - atLeastResult + 1) == -1) && numSurprising>0)
							{
								numGP++;
								numSurprising--;
							}
						}
					}
				}
				System.out.println("Case #"+(i+1)+": "+numGP);
				
				numGP=0;
			}
		}
		catch(IOException ioe)
		{
			ioe.printStackTrace();
		}
		
		
	}
}
