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.util.Scanner;
import java.util.StringTokenizer;

public class DancingWiththeGooglers {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int cases = Integer.parseInt(scan.nextLine());
		for (int i = 0; i < cases; i++) {
			String temp = scan.nextLine();
			StringTokenizer token = new StringTokenizer(temp);
			int N = Integer.parseInt(token.nextToken());
			int S = Integer.parseInt(token.nextToken());
			int P = Integer.parseInt(token.nextToken());
			int[] total = new int[N];
			for (int j = 0; j < total.length; j++) {
				total[j] = Integer.parseInt(token.nextToken());
			}
			System.out.println("Case #" + (i + 1) + ": " + solve(total, S, P));

		}

	}

	private static int solve(int[] total, int s, int p) {
		int ser = s;
		int numberOfWinners = 0;
		for (int i = 0; i < total.length; i++) {
			if (total[i] == 0) {
				if (p == 0)
					numberOfWinners++;
			} else if (total[i] == 1) {
				if (p <= 1)
					numberOfWinners++;
			} else if (total[i] == 2) {
				if (p <= 1)
					numberOfWinners++;
				else if (p == 2 && ser > 0) {
					numberOfWinners++;
					ser--;
				}
			} else {
				int k = total[i] % 3;
				if (k == 0) {
					if (total[i] / 3 >= p)
						numberOfWinners++;
					else if (((total[i] / 3) + 1) >= p && ser > 0) {
						numberOfWinners++;
						ser--;
					}
				} else if (k == 2) {
					int sum = (total[i] / 3) + 1;
					if (sum >= p)
						numberOfWinners++;
					else if ((sum + 1) >= p && ser > 0) {
						numberOfWinners++;
						ser--;
					}

				} else if (k == 1) {
					int sum = (total[i] / 3) + 1;
					if (sum >= p)
						numberOfWinners++;
				}
			}
		}
		return numberOfWinners;

	}
}
