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

import java.io.PrintWriter;
import java.util.Scanner;

public class PB {
	static Scanner sc = new Scanner(System.in);
	static PrintWriter pw = new PrintWriter(System.out);

	public static void main(String[] args) {
		int t = sc.nextInt();
		for (int i = 1; i <= t; i++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[][] d1 = new int[n + 1][s + 1];
			int[][] d2 = new int[n + 1][s + 1];

			for (int j = 1; j <= n; j++) {
				int x = sc.nextInt();

				for (int k = 0; k <= Math.min(s, j); k++) {
					if (k != 0)
						d1[j][k] = Math.max(d1[j - 1][k - 1], d2[j - 1][k - 1])
								+ (check(x, p, true) ? 1 : 0);
					if (k < j)
						d2[j][k] = Math.max(d2[j - 1][k], d1[j - 1][k])
								+ (check(x, p, false) ? 1 : 0);
				}
			}
			pw.println("Case #" + i + ": " + Math.max(d1[n][s], d2[n][s]));
		}
		pw.flush();
	}

	static boolean check(int a, int p, boolean surprised) {

		if (surprised) {
			switch (a % 3) {
			case 0:
				return (a > 0 && a < 28 && ((a + 3) / 3) >= p);
			case 1:
				return (a > 1 && a < 29 && ((a + 2) / 3) >= p);
			case 2:
				return (a < 27 && ((a + 4) / 3) >= p);
			}
		} else {
			switch (a % 3) {
			case 0:
				return (a / 3) >= p;
			case 1:
				return ((a + 2) / 3) >= p;
			case 2:
				return ((a + 1) / 3) >= p;
			}
		}
		return false;
	}
}
