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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.nio.charset.Charset;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;

/**
 * Google Code Jam, Problem B. Result finder
 * 
 * @author Petar
 * 
 */
public class Dancers {
	private static BufferedReader in;
	private static BufferedWriter out;

	/**
	 * Main, reads in scores, outputs max num of Googler's with result p
	 * 
	 * @param args
	 */
	public static void main(String[] args) {
		List<Integer> scores;
		int numSurprise, numGooglers, p, maxGooglers;
		String currLine = "";

		try {
			out = new BufferedWriter(new FileWriter(".out"));
			in = new BufferedReader(new FileReader(".in"));
			int testNum = Integer.parseInt(in.readLine());
			for (int i = 0; i < testNum; i++) {
				maxGooglers = 0;
				currLine = in.readLine();
				String[] testBound = currLine.split(" ");

				numGooglers = Integer.parseInt(testBound[0]);
				numSurprise = Integer.parseInt(testBound[1]);
				p = Integer.parseInt(testBound[2]);
				System.out
						.println(String
								.format("The bounds of the problem are %d googlers, %d surprising results and %d p value",
										numGooglers, numSurprise, p));
				// Read in the scores
				scores = new ArrayList<Integer>(numGooglers);

				for (int j = 0; j < numGooglers; j++) {
					scores.add(Integer.parseInt(testBound[j + 3]));
				}

				// Determine the tallies
				for (Integer score : scores) {
					if (score < (3 * p - 4) || score < p) {
						continue;
					} else if (score >= (3 * p - 2)) {
						maxGooglers++;
					} else {
						if (numSurprise > 0) {
							maxGooglers++;
							numSurprise--;
						}
					}
				}

				Collections.sort(scores);

				out.write(String.format("Case #%d: %d", i + 1, maxGooglers));
				out.newLine();
			}

			in.close();
			out.flush();
			out.close();
		} catch (FileNotFoundException e) {
			System.err.println("Input file was not found");
		} catch (IOException e) {
			System.err.println("Problem reading from input file");
			e.printStackTrace();
		}
	}
}
