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 com.code;

import java.io.BufferedReader;
import java.io.Writer;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class DancingWithGooglers 
{
	public static void main(String[] args) 
	{
		ReadWriteInputFile readObj = new ReadWriteInputFile();
		BufferedReader br = null;
		Writer outWriter = null;
		int caseNo = 0,i=0;
		
		String strLine="";
		br = readObj.readInputFile("B-small-attempt0.in");
		outWriter = readObj.writeOutputFile("output.txt");
		if(br!=null || outWriter!=null)
		{
			try
			{
				caseNo = Integer.parseInt(br.readLine());
				while ((strLine = br.readLine()) != null)
				{
					String[] splitStr = strLine.split(" ");
					int N=Integer.parseInt(splitStr[0]),S=Integer.parseInt(splitStr[1]) , p=Integer.parseInt(splitStr[2]);
					int validCount=0;
					ArrayList totalScores = new ArrayList();
					for (int j = 3; j < splitStr.length; j++) 
					{
						totalScores.add(splitStr[j]);
					}
					for(int j=0;j<totalScores.size();j++)
					{
						int q = Integer.parseInt(totalScores.get(j).toString()) / 3;
						int r = Integer.parseInt(totalScores.get(j).toString()) % 3;
						
						if(r==0)
						{
							if(q>=p)
								validCount++;
							else if((q+1)>=p && S!=0 && q!=0)
							{
								validCount++;S--;
							}
						}
						if(r==1)
						{
							if((q+1)>=p)
								validCount++;
						}
						if(r==2)
						{
							if((q+1)>=p)
								validCount++;
							else if((q+2)>=p && S!=0)
							{
								validCount++;S--;
							}
						}
					}
					outWriter.write("Case #"+(++i)+": "+validCount+"\n");
				}
				
			}
			catch (Exception e) 
			{
				e.printStackTrace();
			}
			readObj.closeObjects(outWriter);
		}
	}
}


/*
 
					
					for(int j=0;j<totalScores.size();j++)
					{
						int checkVal = ( (Integer.valueOf(totalScores.get(j).toString())-p)/2 );
						if(checkVal==p || (checkVal+1)==p)
						{
							validCount++;
						}
						else if(checkVal<p && S!=0 )
						{
							validCount++;S--;
						}
					}
 * */
 