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

public class B
{
	public static int test (int i, int target)
	{
		int n = i/3;
		
		if (i == 0)
		{
			if (target == 0) return 1;
			return 0;
		}	
		if (i == 1)
		{
			if (target <= 1) return 1;
			return 0;
		}
		
		if (i == 2)
		{
			if (target <= 1) return 1;
			if (target <= 2) return 2;
			return 0;
		}
		
		
		if (n >= (target - (i%3 == 0 ? 0 : 1)))
			return 1;

		if (n >= (target - (i%3 == 2 ? 2 : 1)))
			return 2;
		
		return 0;
	}

	public static void main(String... args) throws Exception
	{
		BufferedReader in = new BufferedReader (new FileReader( "B-small-attempt0.in" ));
		
		String line;
		in.readLine(); 
		int casenum = 1;

		String[] nums;
		while ( (line = in.readLine()) != null)
		{
			nums = line.split(" ");

			int target = Integer.valueOf(nums[2]);
			int surprising = Integer.valueOf(nums[1]);
			
			int a = 0, b = 0;
			
			for (int i = 3; i < nums.length; i++)
			{
				//System.out.println( "DEBUG: " + nums[i] + " -> " + test(Integer.valueOf(nums[i]),target));
				switch (test(Integer.valueOf(nums[i]),target))
				{
					case 0: break;
					case 1: a++; break;
					case 2: b++; break;
				}
			}
			int result = a + Math.min(b,surprising);
			System.out.println("Case #" + casenum + ": " + result);
			casenum++;
		}
	}
}