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 DancingWithGooglers {
	public static int[] numbers(int given, boolean check, int p) {
		int[] solution = new int[3];
		int []answer= new int[2];
		int num = given / 3;
		int mod = given % 3;

		solution[0] = num;
		int remain = given - num;
		int newN = remain / 2;
		solution[1] = newN;
		solution[2] = remain - newN;

		if (solution[0] >= p || solution[1] >= p || solution[2] >= p) {
			answer[0]=1;
			answer[1]=0;
			return answer;
		}
		
		if (check) {
			answer[1]=1;
			if ((mod == 0)&&num!=0) {
				solution[0] = num - 1;
				solution[1] = num;
				solution[2] = num + 1;

			} else if ((mod == 1)&&num!=0) {
				solution[0] = num - 1;
				solution[1] = num + 1;
				solution[2] = num + 1;
			} else if (mod == 2) {
				solution[0] = num;
				solution[1] = num;
				solution[2] = num + 2;
			}
		}
		
		if (solution[0] >= p || solution[1] >= p || solution[2] >= p) {
			answer[0]=1;
			
			return answer;
		}
		// System.out.println(solution[0]);
		// System.out.println(solution[1]);
		// System.out.println(solution[2]);
		answer[0]=0;
		answer[1]=0;
		return answer;
		
	}

	public static void solve(String fname) {
		Read r = new Read();
		r.Read(fname);
		String fAnswer="";
		int numOfTest = r.noOfTestCases;
		int[] numOfPlayers = r.N;
		int[] numOfSurprising = r.S;
		int[] ps = r.p;
		int[][] nums = r.all;
		
		for (int i = 0; i < numOfTest; i++) {
			int numOfP = numOfPlayers[i];
			int numOfS = numOfSurprising[i];
			int p = ps[i];
			int[] numsCurr = nums[i];
			int surprised = 0;
			
			int maxNumber = 0;
			for (int j = 0; j < numsCurr.length; j++) {
				if (surprised < numOfS) {
					int []num ;
					num = numbers(numsCurr[j], true, p);
					maxNumber = maxNumber + num[0];
					surprised = surprised + num[1];
				} else {
					int []num ;
					num= numbers(numsCurr[j], false, p);
					maxNumber = maxNumber + num[0];
					surprised = surprised + num[1];
				}
			}
			String ans = "Case #" + (i + 1) + ": " +maxNumber;
			
			fAnswer=fAnswer+ans+"\n";
		}
		System.out.println(fAnswer);
		r.write("out", fAnswer);
	}

	public static void main(String[] args) {
		solve("test");
	}
}
