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 hk.polyu.cslhu.codejam.solution.impl.qualificationround;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import hk.polyu.cslhu.codejam.solution.Solution;

import org.apache.log4j.Logger;

public class SpeakingInTongues extends Solution {
	private Map<String, String> codeMap;
	private String oriText;
	
	private void setCodeMap() {
		this.codeMap = new HashMap<String, String>();
		codeMap.put("y", "a");
		codeMap.put("e", "o");
		codeMap.put("q", "z");
		codeMap.put("z", "q");
		
		List<String> oriTextList = new ArrayList<String>();
		oriTextList.add("ejp mysljylc kd kxveddknmc re jsicpdrysi");
		oriTextList.add("rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd");
		oriTextList.add("de kr kd eoya kw aej tysr re ujdr lkgc jv");
		
		List<String> encodedTextList = new ArrayList<String>();
		encodedTextList.add("our language is impossible to understand");
		encodedTextList.add("there are twenty six factorial possibilities");
		encodedTextList.add("so it is okay if you want to just give up");
		
		for (int i = 0; i < oriTextList.size(); i++) {
			String oriText = oriTextList.get(i);
			String encodedText = encodedTextList.get(i);
			
			for (int j = 0; j < oriText.length(); j++) {
				String ori = oriText.substring(j, j + 1);
				String encoded = encodedText.substring(j, j + 1);
				
				if (ori.equals(" "))
					continue;
				
				if (! codeMap.containsKey(ori))
					codeMap.put(ori, encoded);
				else if (! codeMap.get(ori).equals(encoded))
					logger.error("Found duplicate encoded string for input " + ori);
			}
		}
		
		logger.info("The size of code map is " + this.codeMap.size());
	}
	
	@Override
	public void setProblem(List<String> problemDesc) {
		// TODO Auto-generated method stub
		this.oriText = problemDesc.get(0);
	}

	@Override
	public void solve() {
		// TODO Auto-generated method stub
		this.setCodeMap();
		
		this.result = "";
		
		for (int i = 0; i < this.oriText.length(); i++) {
			String ori = this.oriText.substring(i, i + 1);
			
			if (ori.equals(" "))
				this.result += ori;
			else if (this.codeMap.containsKey(ori))
				this.result += this.codeMap.get(ori);
			else
				logger.error("Failure to find the encoded string for " + ori);
		}
	}
}
