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

/**
 *
 *
 * @Author      :Yasith Maduranga(Merlin)
 * @version     :1.0
 * @Date        :2012/4/14
 * @Copyright GSharp Lab, All Rights Reserved....
 */
import java.io.*;
import java.util.*;

class dancinwith {
	public static void main(String args[]){
		try{
	    	BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
	    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt0.out")));

	    	int noOfCases = Integer.parseInt(br.readLine());

	    	for(int i=0;i<noOfCases;i++){
				String tmp[]=br.readLine().split(" ");
				int noOfGooglers=Integer.parseInt(tmp[0]);
				int noOfSuprisingScores=Integer.parseInt(tmp[1]);
				int bestResult=Integer.parseInt(tmp[2]);
				int maximumNo=0;

				for(int j=3;j<tmp.length;j++){
					int marks=Integer.parseInt(tmp[j]);
					int mod=marks/3;
					switch(marks%3){
						case 0:{
							if(mod>=bestResult){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod>0 && mod+1>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
						case 1:{
							if(mod>=bestResult || mod+1>=bestResult ){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod+1>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
						case 2:{
							if(mod+1>=bestResult || mod>=bestResult){
								maximumNo++;
							}else{
								if(noOfSuprisingScores>0 && mod+2>=bestResult){
									maximumNo++;
									noOfSuprisingScores--;
								}
							}
							break;
						}
					}
				}


				out.println("Case #"+(i+1)+": "+maximumNo);
	    	}



	    	out.close();
		}catch(Exception e){
			e.printStackTrace();
		}
	    	System.exit(0);
	}
}
