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.*;
import java.awt.*;
import java.lang.*;
import java.util.*;

public class SolutionTwo {
	public static void main(String[] args) {
		String fileName = null;
		if (args.length > 0) {
			fileName = args[0];
		}
		File file = null;
		Scanner fileScanner = null;
		Scanner lineScanner;
		try {
			file = new File(fileName);
			fileScanner = new Scanner(file);
			int numLines = Integer.parseInt(fileScanner.nextLine());
			for (int lineNumber = 1; lineNumber <= numLines; lineNumber++) {
				String line = fileScanner.nextLine();
				lineScanner = new Scanner(line);
				int numGooglers = lineScanner.nextInt();
				int numSuprisingAllowed = lineScanner.nextInt();
				int leastMaxScore = lineScanner.nextInt();
				int googlerMax = 0;
				int numSuprising = 0;
				int numNotSuprising = 0;
				for (int i = 0; i < numGooglers; i++) {
					googlerMax = lineScanner.nextInt();
					if (googlerMax < leastMaxScore) continue;
					// not suprising
					int testNum = leastMaxScore + (2 * (leastMaxScore - 1));
					if (testNum <= googlerMax) {
						numNotSuprising++;
						continue;
					}
					
					// suprising
					testNum = leastMaxScore + (2 * (leastMaxScore - 2));
					if (testNum <= googlerMax) {
						numSuprising++;
					}
				}
				int answer;
				if (numSuprising <= numSuprisingAllowed) {
					answer = numNotSuprising + numSuprising;
				} else {
					answer = numNotSuprising + numSuprisingAllowed;
				}
				System.out.print("Case #" + lineNumber + ": " + answer);
				System.out.println();
			}
		} catch (Exception e) {
			System.out.println("Error");
		}
	}
}
