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.InputStreamReader;
public class GooglersDance {
	static int output = 0;
	static int numberOfDancers = 0;
	static int surprise = 0;
	static int bestResult = 0;

	public static void main(String[] args) {
		try {

			InputStreamReader isr = new InputStreamReader(System.in);
			BufferedReader reader = new BufferedReader(new FileReader("e:/B-small-attempt0.in"));
			int totalLines = Integer.parseInt(reader.readLine());
			for(int k=0;k<totalLines;k++)
			{
				String[] input = reader.readLine().split(" ");
				numberOfDancers = Integer.parseInt(input[0]);
				surprise = Integer.parseInt(input[1]);
				bestResult = Integer.parseInt(input[2]);
				output = 0;
				
				int [] totalPoints = new int[numberOfDancers];
				for (int i = 0; i < totalPoints.length; i++) {
					totalPoints[i] = Integer.parseInt(input[3+i]);
					isBestReesult(totalPoints[i]);
				}
				System.out.println("Case #" + (k+1) + ": " + output);
			}
		} catch (Exception ex) {
			System.out.println(ex);
		}
	}

	private static void isBestReesult(int i) {
		int av = i/3;
		int rem = i%3;

		if(av+2 < bestResult)
			return;

		if(rem == 0)
		{
			if(av >= bestResult)
			{
				output++;
			}else if(av+1 >= bestResult && av+1 <= i && surprise > 0)
			{
				output++;
				surprise--;
			}
		}else if(rem == 1)
		{
			if((av >= bestResult || av+1 >= bestResult) && av+1 <= i)
				output++;
		}else
		{
			if((av >= bestResult || av+1 >= bestResult) && av+1 <= i )
			{
				output++;
			}else if(av+2 >= bestResult && surprise > 0 && av+1 <= i )
			{
				output++;
				surprise--;
			}
		}
	}
}
