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.google.codejam;

import java.io.File;
import java.io.IOException;
import java.util.List;

import com.google.common.base.CharMatcher;
import com.google.common.base.Function;
import com.google.common.base.Splitter;
import com.google.common.collect.Iterables;
import com.google.common.collect.Lists;
import com.google.common.io.Files;
import com.google.gdata.util.common.base.Charsets;

public class ProblemB {
	
	public static void main (String [] args) throws IOException {
		if (args.length != 1) {
			System.err.println("Usage: ProblemB inputfile");
			return;
		}
		String filename = args[0];
		List<String> inputLines = Files.readLines(new File(filename), Charsets.US_ASCII);
		int T = Integer.parseInt(inputLines.get(0));
		List<String> testCases = inputLines.subList(1, inputLines.size());
		assert(T == testCases.size());
		for (int i = 0; i < testCases.size(); i++) {
			processLine(testCases, i);
		}
	}

	private static void processLine(List<String> testCases, int i) {
		String line = testCases.get(i);
		List<Integer> lineContents = Lists.newArrayList(Iterables.transform(Splitter.on(CharMatcher.WHITESPACE).split(line), new Function<String, Integer>() {
			@Override
			public Integer apply(String input) {
				return Integer.parseInt(input);
			}
		}));
		
		int numGooglers = lineContents.get(0);
		int numSurprising = lineContents.get(1);
		int targetBestResult = lineContents.get(2);
		List<Integer> scores = lineContents.subList(3, lineContents.size());
		assert(numGooglers == scores.size());
		int maxNumGooglers = 0;
		int numGooglersWithSurprise = 0;
		for (int score : scores) {
			if (((score + 2) / 3) >= targetBestResult) {  // This is equivalent to ciel(score/3) >= targetBestResult
				maxNumGooglers++;
			} else if ((score + 4) / 3 >= targetBestResult && score > 0) {
				numGooglersWithSurprise++;
			}
		}
		
		maxNumGooglers += Math.min(numGooglersWithSurprise, numSurprising);
		System.out.println("Case #" + (i+1) + ": " + maxNumGooglers);
	}

}
