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

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.Arrays;

public class DanceScores {

	public static void main(String[] args) throws Exception {
		new DanceScores().init();
	}

	private void init() throws Exception {

		int counter = 1;
		BufferedReader br = new BufferedReader(new FileReader(
				"C:\\Users\\i053957\\Downloads\\B-small-attempt0.in"));
		String line = br.readLine();
		while ((line = br.readLine()) != null) {
			int belowMin = 0;
			String[] values = line.split("[ ]");
			int[] scores = new int[Integer.parseInt(values[0])];
			int specialCount = Integer.parseInt(values[1]);
			int min = Integer.parseInt(values[2]);
			for (int i = 3; i < values.length; i++) {
				scores[i - 3] = Integer.parseInt(values[i]);
			}

			if (min > 1) {
				Arrays.sort(scores);
				for (int score : scores) {
					if ((min * 3 - score) < 3) {

					} else if ((min * 3 - score) < 5) {
						if (specialCount > 0) {
							specialCount--;
						} else {
							belowMin++;
						}
					} else {
						belowMin++;
					}
				}
			} else if (min == 1) {
				Arrays.sort(scores);
				for (int score : scores) {
					if (score == 0) {
						belowMin++;
					}
				}
			}

			System.out.println("Case #" + counter + ": "
					+ (scores.length - belowMin));
			counter++;
		}

		br.close();
	}
}
