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


public class caseHandler {

	int N;
	int S;
	int P;
	
	int bestNum;
	
	int[] scores;
	
	public caseHandler(int N, int S, int P, int[] scores){
		this.N = N;
		this.S = S;
		this.P = P;
		this.scores = scores;
		this.bestNum = 0;
	}
	
	public int solveCase(){
		loopCase(scores[0], 0, 0, 0);
		return bestNum;
	}
	
	private void loopCase(int score, int currN, int Scount, int pNumCount){
		int currSCount = Scount;
		int currpNumCount = pNumCount;
		
		int aproxMinScore = score/3 - 1;
		if (aproxMinScore < 0) aproxMinScore = 0;
		for(int i=aproxMinScore;i<=10;i++){
			for(int j=aproxMinScore;j<=10;j++){
				if(Math.abs(i-j)>2) continue;
				for(int k=aproxMinScore;k<=10;k++){
					int min = Math.min(Math.min(i, j), k);
					if(Math.abs(min-i)>2 || Math.abs(min-j)>2 || Math.abs(min-k)>2) continue;
					if(i+j+k == score){
						int s = 0;
						int p = 0;
						if(Math.abs(i-j)==2 || Math.abs(k-j)==2 || Math.abs(k-i)==2) s = 1;
						if(currSCount+s > S) continue;
							else{
							if(i>=P || j>=P || k>=P) p = 1;
							
							if(currN == N-1){
								if(currpNumCount+p > bestNum) bestNum=currpNumCount+p;
							}
							else loopCase(scores[currN+1], currN+1, currSCount+s, currpNumCount+p);
						}
					}
				}
			}
		}
	}
}
