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.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;

public class B {

	public static void main(String[] args) throws NumberFormatException, IOException {
		File file = new File(args[0]);
		BufferedReader reader = new BufferedReader(new FileReader(file));
		PrintStream printer = new PrintStream(new File("B-small.txt"));

		int t = Integer.parseInt(reader.readLine());
		for (int i = 0; i < t; i++) {
			String sa = reader.readLine();
			String[] nums = sa.split(" ");
			// int n = Integer.parseInt(nums[0]);
			int s = Integer.parseInt(nums[1]);
			int p = Integer.parseInt(nums[2]);
			int cs = 0;
			int ans = 0;
			for (int j = 3; j < nums.length; j++) {
				int a = Integer.parseInt(nums[j]);
				if (isP(a, p)) {
					if (isSurprising(a, p)) {
						// not taking care of the scenario where 
						// mandate surprising are less than 's'
						// as the question confims there will atleast
						// be s ts that can be surprising
						cs++;
						if (cs > s)
							continue;
						ans++;
					}
					else
						ans++;
				}
			}
			printer.println("Case #" + (i+1) + ": " + ans);
		}
		printer.close();
		reader.close();
	}

	static boolean isSurprising(int a, int p) {
		if (((a - p) / 2) >= p)
			return false;
		if (Math.abs(p - ((a - p) / 2)) == 2)
			return true;
		return false;
	}
	
	static boolean isP(int a, int p) {
		if (a < p)
			return false;
		if (((a - p) / 2) >= p)
			return true;
		if (Math.abs(p - ((a - p) / 2)) <= 2)
			return true;
		return false;
	}
}
