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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancingwithgoogler;

/**
 *
 * @author WC
 */
public class DancingWithGoogler {
	private int numberOfSurprising = 0;
	/**
	 * @param args the command line arguments
	 */
	public static void main(String[] args) {
		(new DancingWithGoogler()).getMaximumBestResults("B-small-attempt1.in", "B-small-attempt1.out", "\n");
	}
	
	private void getMaximumBestResults(String filename, String outputFilename, String separator) {
		int numOfTestCases = CodeJamFileManager.getIntFromFirstLineOfFile(filename, separator);
		String[] testCases = CodeJamFileManager.getTextLinesOfFile(filename, separator);
		String output = "";
		for (int i = 1; i <= numOfTestCases; i++) {
			output += "Case #" + i + ": " + getMaximumBestResultOccurence(testCases[i]) + (i != numOfTestCases ? separator : "");
		}
		CodeJamFileManager.saveOutputFile(output, outputFilename, separator);
	}
	
	private int getMaximumBestResultOccurence(String testCase) {
		int[] intFigures = getIntArrayFromString(testCase.split(" "));
		int numberOfGooglers = intFigures[0];
		numberOfSurprising = intFigures[1];
		int bestResultOf = intFigures[2];
		int counter = 3;
		int maxBestResultOccurence = 0;
		boolean canBeSurprising = true;
		while (counter < intFigures.length) {
			if (numberOfSurprising == 0)
				canBeSurprising = false;
			if (googlerHasBestResult(intFigures[counter], bestResultOf, canBeSurprising))
				maxBestResultOccurence++;
			counter++;
		}
		return maxBestResultOccurence;
	}
	
	private boolean googlerHasBestResult(int score, int bestScoreToBeat, boolean canBeSurprising) {
		int remainder = score % 3;
		int avgScore = score / 3;
		if (avgScore >= bestScoreToBeat) {
			return true;
		}
		else  if (bestScoreToBeat - avgScore == 1) {
			if (remainder != 0) {
				return true;
			}
			else if (canBeSurprising && avgScore != 0) {
				numberOfSurprising--;
				return true;
			}
		}
		else if (bestScoreToBeat - avgScore == 2) {
			if (remainder == 2 && canBeSurprising) {
				numberOfSurprising--;
				return true;
			}
			return false;
		}
		return false;
	}
	
	private int[] getIntArrayFromString(String[] intStrArray) {
		int[] intArray = new int[intStrArray.length];
		int i = 0;
		for (String intStr : intStrArray) {
			intArray[i++] = Integer.parseInt(intStr);
		}
		return intArray;
	}
}