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


public class DancingGooglers {

	private static int sc;

	private static int result = 0;
	
	private static int p;
	
	private static void check(int val) {
		int x = val % 3;
		int n = val / 3;
		if (x == 0) {
			if (n >= p) {
				result++;
			} else if (n > 0 && sc > 0 && n + 1 >= p) {
				result++;
				sc--;
			}
		} else {
			if (n + 1 >= p) {
				result++;
			} else if (x == 2 && n + 2 >= p && sc > 0) {
				result++;
				sc--;
			}
		}
	}
	
	public static void main(String[] args) throws Exception {
		String[] in = ProblemUtils.readInput("/home/laf/Downloads/B-small-attempt0.in");
		String[] out = new String[in.length];
		for (int i = 0; i < in.length; i++) {
			String[] vals = in[i].split(" ");
			int n = Integer.parseInt(vals[0]);
			sc = Integer.parseInt(vals[1]);
			p = Integer.parseInt(vals[2]);
			result = 0;
			for (int j = 3; j < 3 + n; j++) {
				check(Integer.parseInt(vals[j]));
				out[i] = "" + result;
			}
		}
		ProblemUtils.writeOutput("/home/laf/Desktop/out.txt", out);
	}
	
}
