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 code.google.com;

import java.util.Scanner;

public class problemB {

	public static void main(String[] Args) {
		Scanner sc = new Scanner(System.in);
		int tests = sc.nextInt();
		int n, s, p;

		sc.nextLine();

		for (int i = 1; i <= tests; i++) {
			int t;
			int count = 0;
			int uCount = 0;
			n = sc.nextInt();
			s = sc.nextInt();
			p = sc.nextInt();

			for (int j = 1; j <= n; j++) {
				t = sc.nextInt();
				if (suprise(t) >= p && unsuprise(t) >= p)
					count++;
				else if (suprise(t) >= p)
					count++;
				else if (unsuprise(t) >= p)
					uCount++;
			}

			if (s < uCount)
				uCount = s;

			System.out.println("Case #" + i + ": " + (count + uCount));
			sc.nextLine();

		}

	}

	public static int max(int a, int b, int c) {
		int max = Integer.MIN_VALUE;

		if (a > max)
			max = a;
		if (b > max)
			max = b;
		if (c > max)
			max = c;

		return max;
	}

	public static int suprise(int t) {

		int dim;

		dim = t / 3;

		if (t == 0)
			return 0;
		if (t == 30)
			return 30;

		if (dim > 0) {
			int p;

			p = (dim + 1) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 1), (dim + 1), (dim));
			p = (dim + 1) + (dim) + (dim);
			if (p == t)
				return max((dim + 1), (dim), (dim));
			p = (dim) + (dim) + (dim);
			if (p == t)
				return max((dim), (dim), (dim));
			p = (dim - 1) + (dim) + (dim);
			if (p == t)
				return max((dim - 1), (dim), (dim));
			p = (dim - 1) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 1), (dim - 1), (dim));

		} else
			return 1;

		return -1;
	}

	public static int unsuprise(int t) {
		int dim;
		int p;

		dim = t / 3;

		if (t == 0)
			return 0;
		if (t == 30)
			return 30;

		if (dim > 1 && dim < 9) {

			p = (dim + 2) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 1), (dim));
			p = (dim + 2) + (dim + 2) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 2), (dim));
			p = (dim + 2) + (dim) + (dim);
			if (p == t)
				return max((dim + 2), (dim), (dim));
			p = (dim - 2) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 1), (dim));
			p = (dim - 2) + (dim) + (dim);
			if (p == t)
				return max((dim - 2), (dim), (dim));
			p = (dim - 2) + (dim - 2) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 2), (dim));
			p = (dim - 1) + (dim + 1) + (dim);
			if (p == t)
				return max((dim - 1), (dim + 1), (dim));

		}

		if (dim <= 1) {

			p = (dim + 2) + (dim) + (dim);
			if (p == t)
				return max((dim + 2), (dim), (dim));
			p = (dim + 2) + (dim + 2) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 2), (dim));
			p = (dim + 2) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 1), (dim));

			if (dim == 1) {
				p = (dim - 1) + (dim + 1) + (dim);
				if (p == t)
					return max((dim - 1), (dim + 1), (dim));
			}

		}

		if (dim >= 9) {

			p = (dim - 2) + (dim - 2) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 2), (dim));
			p = (dim - 2) + (dim) + (dim);
			if (p == t)
				return max((dim - 2), (dim), (dim));
			p = (dim - 2) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 1), (dim));

			if (dim == 9) {
				p = (dim - 1) + (dim + 1) + (dim);
				if (p == t)
					return max((dim - 1), (dim + 1), (dim));
			}

		}

		return -1;
	}
}
