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;
	}
}

package com.lewis.codeJamInJava;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;

public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {

			File outpuFile = new File("output.txt");
			FileWriter fileWriter = new FileWriter(outpuFile);
			BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);

			BufferedReader bufferedReader;
			File inputFile = new File("input.txt");
			FileReader fileReader = new FileReader(inputFile);
			bufferedReader = new BufferedReader(fileReader);

			int numTestCases = Integer.parseInt(bufferedReader.readLine());

			for (int i = 1; i <= numTestCases; i++) {

				StringTokenizer st = new StringTokenizer(
						bufferedReader.readLine());

				int numGooglers = Integer.parseInt(st.nextToken());
				int numSurprisingScores = Integer.parseInt(st.nextToken());
				int passingScore = Integer.parseInt(st.nextToken());

				int scores[] = new int[numGooglers];

				for (int j = 0; j < numGooglers; j++) {
					scores[j] = Integer.parseInt(st.nextToken());
				}

				int passingGrades = getNumPassingScores(scores, passingScore,
						numSurprisingScores);

				bufferedWriter
						.write("Case #" + i + ": " + passingGrades + "\r\n");

			}
			bufferedWriter.flush();
			bufferedWriter.close();

		} catch (Exception e) {
			e.printStackTrace();
		}

	}

	/**
	 * Given scores, passing score and surpising scores, generates the number of
	 * passes.
	 * 
	 * @param scores
	 * @param passingScore
	 * @param numSurprisingScores
	 * @return
	 */
	public static int getNumPassingScores(int[] scores, int passingScore,
			int numSurprisingScores) {

		int numPassing = 0;
		int easyPass = passingScore * 3 - 2;
		int surprisingPass = passingScore * 3 - 4;

		if (easyPass < 0) {
			surprisingPass = 0;
			easyPass = 0;
		} else if(surprisingPass < 0){
			surprisingPass = 0;
		}

		for (int i = 0; i < scores.length; i++) {
			if(scores[i] < passingScore){
				
			} else if (scores[i] >= easyPass) {
				numPassing++;
			} else if (numSurprisingScores > 0 && scores[i] >= surprisingPass) {
				numSurprisingScores--;
				numPassing++;
			}

		}

		return numPassing;
	}

}
