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 void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader(args[0]));
		in.readLine();
		
		String[] segments;
		int[] scores;
		int numCase = 0;
		while (in.ready()) {
			segments = in.readLine().split(" ");
			scores = new int[segments.length - 3];
			for (int i = 0; i < scores.length; ++i) {
				scores[i] = Integer.parseInt(segments[i + 3]);
			}
			solve(++numCase, Integer.parseInt(segments[1]), Integer.parseInt(segments[2]), scores);
		}
	}
	
	private static void solve(int caseNum, int s, int p, int[] scores) {
		int max = 0;
		
		if (p == 0) {
			max = scores.length;
		} else if (p == 1) {
			for (int i = 0; i < scores.length; ++i) {
				if (scores[i] >= 1) {
					++max;
				}
			}
		} else {
			int limit1 = (p - 2) * 3 + 2;
			int limit2 = limit1 + 1;
			
			int needS = 0;
			
			int score;
			for (int i = 0; i < scores.length; ++i) {
				score = scores[i];
				if (score < limit1) {
					continue;
				}
				
				if (score <= limit2) {
					++ needS;
					continue;
				}
				
				++max;
			}
			
			max += Math.min(needS, s);
		}
		
		System.out.printf("Case #%d: %d\n", caseNum, max);
	}
}