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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;

public class GoogleDancer {

	public static void main (String[] args) {
		String inputFile = "D:\\B-small-attempt0.in";
		String outputFile = "D:\\out2.txt";
		String prefix = "Case #";
		int p = 0;
		int s = 0;
		int n = 0;
		try {
			BufferedWriter bw = new BufferedWriter(new FileWriter(outputFile));
			BufferedReader br = new BufferedReader(new FileReader(inputFile));
			String line = "";
			line = br.readLine();
			int num = Integer.valueOf(line);
			for (int i = 1; i <= num; i++) {
				String tline = br.readLine();
				String[] nStr = tline.split("\\s+");
				int result = 0;
				int len = nStr.length;
				int[] intS = new int[len];
				for (int j = 0; j < len; j++) {
					intS[j] = Integer.valueOf(nStr[j]);
				}
				n = intS[0];
				s = intS[1];
				p = intS[2];
				int v1 = 3 * p - 2;
				v1 = v1 > 0 ? v1 : 0;
				ArrayList<Integer> left = new ArrayList<Integer>();
				for (int k = 0; k < n; k++) {
					if (intS[k+3] >= v1)
						result++;
					else
						left.add(intS[k+3]);
				}
				int v2 = v1 - 2;
				v2 = v2 > 0 ? v2 : 0;
				int leftlen = left.size();
				for (int k = 0; k < leftlen && s > 0; k++) {
					if (left.get(k) >= v2 && left.get(k) >= 2) {
						result++;
						s--;
					}
				}
				String output = prefix + i + ": " + result;
				bw.write(output);
				if (i < num)
					bw.write("\n");
			}
			br.close();
			bw.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}
