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.googlecode.codejam.model;

import java.io.BufferedWriter;
import java.io.File;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;

import org.apache.commons.io.FileUtils;
import org.apache.commons.io.IOUtils;

public class JamResolver {

	private final JamCaseResolverFactory jamCaseResolverFactory;
	
	private final File input;
	
	private final File output;

	public JamResolver(JamCaseResolverFactory jamCaseResolverFactory, String parentDirectory, String fileName) {
		this.jamCaseResolverFactory = jamCaseResolverFactory;
		if(!new File(parentDirectory).exists())
			parentDirectory = Constants.PARENT_DIRECTORY + parentDirectory;
		this.input = new File(parentDirectory, fileName);
		this.output = new File(parentDirectory, fileName.replaceFirst("\\.in$", ".out"));
	}
	
	public void resolve() throws Exception {
		System.out.println("Started computation, resolver: " + jamCaseResolverFactory.getClass().getPackage().getName());
		System.out.println("Input\tFile: " + input.getAbsolutePath());
		System.out.println("Output\tFile: " + output.getAbsolutePath());
		final ExecutorService executor = Executors.newFixedThreadPool(1);
		try {
			final Iterator<String> lineIterator = FileUtils.lineIterator(input, "UTF-8");
			final int caseNumber = Integer.parseInt(lineIterator.next());
			final List<Future<String>> solutions = new ArrayList<Future<String>>(caseNumber);
			for (int i = 1; i <= caseNumber; i++) {
				solutions.add(executor.submit(jamCaseResolverFactory.newJamCaseResolver(i, lineIterator)));
			}
			final BufferedWriter solutionFile = new BufferedWriter(new OutputStreamWriter(FileUtils.openOutputStream(output)));
			int count = 1;
			try {
				for (Future<String> future : solutions) {
					solutionFile.append("Case #").append(String.valueOf(count++)).append(": ");
					solutionFile.append(future.get());
					solutionFile.newLine();
				}
			} finally {
				IOUtils.closeQuietly(solutionFile);
			}
		} finally {
			executor.shutdown();
		}
		System.out.println("Ended computation");
	}
	
}
