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

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

public class MainClass {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new File("B-small-attempt1.in"));
		PrintWriter out = new PrintWriter(new File("Dancing-small.out"));

		int T = sc.nextInt();
		for (int i = 0; i < T; i++) {
			int ans = 0;

			int N = sc.nextInt(), S = sc.nextInt(), p = sc.nextInt();
			ArrayList<Integer> sums = new ArrayList<Integer>();
			for (int j = 0; j < N; j++) {
				sums.add(sc.nextInt());
			}
			for (int j = 0; j < N; j++) {
				int tempP = p;

				int sum = sums.get(j);
				int sumBackup = sum;
				while (tempP <= 10 && tempP <= sumBackup) {
					sum = sums.get(j);
					sum -= tempP;
					int half = sum / 2;
					int half2 = sum - half;

					if ((Math.abs(half2 - half) <= 1)
							&& (Math.abs(half2 - tempP) <= 1)
							&& (Math.abs(tempP - half) <= 1)) {
						ans++;
						int test = sums.remove(j);
						// System.out.println(test + "\t " + tempP + "\t" + half
						// + "\t" + half2);
						j--;
						N--;
						break;
					}
					tempP++;

				}

			}
			// System.out.println(S);
			outer: for (int j = 0; j < N; j++) {
				int tempP = p;

				int sum = sums.get(j);
				int sumBackup = sum;
				while (tempP <= 10 && tempP <= sumBackup) {
					sum = sums.get(j);
					sum -= tempP;
					int half = sum / 2;
					int half2 = sum - half;
					if ((Math.abs(half2 - half) <= 2)
							&& (Math.abs(half2 - tempP) <= 2)
							&& Math.abs(tempP - half) <= 2) {
						if (S != 0) {

							ans++;
							S--;

							int test = sums.remove(j);
							// System.out.println(test + "\t " + tempP + "\t"
							// + half + "\t" + half2 + "\t" + S);

							j--;
							N--;
							break;
						}
						if (S == 0) {
							// System.out.println("broke");
							break outer;
						}
					}
					tempP++;

				}

			}
			/* System.out.println(sums); */
			out.println("Case #" + (i + 1) + ": " + ans);
		}
		out.close();

	}
}
