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 se.pathed.codejam.practice.dansingwithgooglers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;

public class DancingWithGooglers {

	public File getFileFromDisk(String fileName){
		String dataFolder = "C:\\Users\\Patrik\\workspaces\\codejam\\Practis\\data\\";
		return new File(dataFolder + fileName);
	}

	public static void main(String[] args) throws IOException{
		new DancingWithGooglers().run();
	}

	public static class Problem {
		int numDancers;
		int numSupprises;
		int searched;
		int solution;
		int[] scores;
	}
	
	public Problem[] parseInput() throws IOException{
		File f = getFileFromDisk("B-small-attempt0.in");
		FileReader fReader = new FileReader(f);
		BufferedReader reader = new BufferedReader(fReader);
		
		int numCases = Integer.parseInt(reader.readLine());
		Problem[] probs = new Problem[numCases];
		
		for( int i = 0; i < numCases; i++){
			Problem p = new Problem();
			String[] strInp = reader.readLine().split(" ");
			p.numDancers = Integer.parseInt(strInp[0]);
			p.numSupprises = Integer.parseInt(strInp[1]);
			p.searched = Integer.parseInt(strInp[2]);
			
			p.scores = new int[p.numDancers];
			for( int x = 3; x < strInp.length; x++){
				p.scores[x-3] = Integer.parseInt(strInp[x]);
			}
			probs[i] = p;
		}
		
		return probs;
	}
	
	private void run() throws IOException {
		Problem[] problems = parseInput();
		
		File outputFile = getFileFromDisk("out.txt");
		if( outputFile.exists()) outputFile.delete();
		PrintWriter outFile = new PrintWriter(outputFile);
		
		for( int i = 0; i < problems.length; i++){
			Problem p = problems[i];
			
			int lowestScore = ( p.searched * 3) -2;
			int lowestSuppriseScore = lowestScore - 2;

			int possibleScore = 0;
			int possibleSupprise = 0;
			
			for( int sc : p.scores ){
				if( sc >= lowestScore){
					possibleScore++;
				} else if( sc >= lowestSuppriseScore && sc > 0){
					possibleSupprise++;
				}
			}
			
			p.solution = possibleScore + (possibleSupprise > p.numSupprises ? p.numSupprises : possibleSupprise);
			
			outFile.println("Case #" + (1+i) + ": " + p.solution);
		}
		outFile.flush();
	}
}
