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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;

public class DancingWithGooglers {

	public static void main(String[] args) throws IOException {
		String msg = "";
		BufferedReader br = null;
		String sCurrentLine = null;
		Map<String, String> map = new HashMap<String, String>();
		br = new BufferedReader(new FileReader("test"));
		sCurrentLine = br.readLine();
		int x = 0;
		if (sCurrentLine != null) {
			while ((sCurrentLine = br.readLine()) != null) {
				int qualifiedGooglers = 0;
				msg = "";
				String[] eachTestCase = sCurrentLine.split(" ");
				int noOfGooglers = Integer.parseInt(eachTestCase[0]);
				int noOfSurprises = Integer.parseInt(eachTestCase[1]);
				int minReqd = Integer.parseInt(eachTestCase[2]);
				int[] googlersPoint = new int[noOfGooglers];
				int k = 0;
				for (int i = 3; i < eachTestCase.length; i++) {
					int j = Integer.parseInt(eachTestCase[i]);
					googlersPoint[k++] = j;
				}
				for (int i = 0; i < noOfGooglers; i++) {
					if (googlersPoint[i] == 0) {
						if (minReqd == 0)
							qualifiedGooglers++;
					} else if ((googlersPoint[i] + 2) / 3 >= minReqd) {
						qualifiedGooglers++;
					} else if (noOfSurprises > 0) {
						if ((googlersPoint[i] + 4) / 3 >= minReqd) {
							qualifiedGooglers++;
							noOfSurprises--;
						}

					}
				}
				x++;
				msg += "Case #" + x + ": " + qualifiedGooglers;
				System.out.println(msg);
			}
		}

	}
}
