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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;


public class Dancing
{
	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		try {
			FileReader fs = new FileReader("/tmp/dancing.in");
			BufferedReader in = new BufferedReader(fs);
			FileWriter fso = new FileWriter("/tmp/dancing.out");
			BufferedWriter out = new BufferedWriter(fso);

			String strLine;
			int i=0;
			int matches;

			while ((strLine = in.readLine()) != null)
			{
				if (i > 0) {
					// parse input line
					String[] strings = strLine.split(" ");
					final int[] ints = new int[strings.length];
					for (int j = 0; j < strings.length; j++) {
						ints[j] = Integer.parseInt(strings[j]);
					}

					matches = findMatches(ints[1], ints[2], Arrays.copyOfRange(ints, 3, 3+ints[0]));

					out.write(new StringBuilder("Case #").append(i)
							.append(": ").append(matches).append("\n")
							.toString());
				}
				i++;
			}

			in.close();
			out.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}

	private static int findMatches(int surprises, int bestResult, int[] ts)
	{
		int matches = 0;

		List<Integer> totalScores = new ArrayList<Integer>(ts.length);
		for (int index = 0; index < ts.length; index++){
			totalScores.add(ts[index]);
	    }
		Collections.sort(totalScores, Collections.reverseOrder());
		System.out.print("Surprises: " + surprises + " Best: " + bestResult + " Scores: " + totalScores);

		for (int totalScore : totalScores)
		{
			int min = totalScore / 3;
			int delta = totalScore % 3;
			int max = min + delta;

			System.out.print(" [Min: " + min + " / Max: " + max + "]");

			if ((max == bestResult) && (delta == 2) && (surprises > 0)) {
				matches++;
				surprises--;
			} else if ((min + 1 == bestResult) && (max + 1 == bestResult) && (min > 0) && (surprises > 0)) {
				matches++;
				surprises--;
			} else if ((min + 1 >= bestResult) && (max >= bestResult)) {
				matches++;
			}
		}

		System.out.println(" Result: " + matches);
		return matches;
	}
}