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 cat.aubricoc.codejam;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;

public class DancingWithTheGooglers {
	
	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader(ClassLoader.getSystemResource("in.txt").getFile()));
		PrintWriter out = new PrintWriter(new File("C:/esilog/codejam/dancing-with-the-googlers/src/main/resources/out.txt"));
		int num = Integer.parseInt(in.readLine().trim());
		for (int iter = 0; iter < num; iter++) {
			String line = in.readLine();
			Integer sol = calculate(line);
			out.println("Case #" + (iter + 1) + ": " + sol);
		}
		in.close();
		out.flush();
		out.close();
	}

	private static Integer calculate(String line) {
		int n = 0;
		String[] nums = line.split(" ");
		int numGooglers = Integer.parseInt(nums[0].trim());
		int numSurpises = Integer.parseInt(nums[1].trim());
		int punts = Integer.parseInt(nums[2].trim());
		
		for (int iter = 0; iter < numGooglers; iter++) {
			int score = Integer.parseInt(nums[3 + iter].trim());
			int mid = score / 3;
			int res = score % 3;
			if (mid >= punts) {
				n++;
			} else {
				int diff = punts - mid;
				if (res == 0 && diff == 1 && numSurpises > 0 && mid > 0) {
					n++;
					numSurpises--;
				} else if (res == 1 && diff == 1) {
					n++;
				} else if (res == 2) {
					if (diff == 1) {
						n++;
					} else if (diff == 2 && numSurpises > 0) {
						n++;
						numSurpises--;
					}
				}
			}
		}
		
		return n;
	}
}
