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 DataModel extends Thread {
		
		private int googlersNo;
		private int suprScore;
		private int minScore;
		private int[] googScore;
		private int caseNo;
		private int output;
		private boolean stateCalc;
		
		public DataModel(String input, int caseNo) {
			this.caseNo = caseNo;
			String[] temp = input.split(" ");
			stateCalc = false;
			try {
				googlersNo = Integer.parseInt(temp[0]);
				suprScore = Integer.parseInt(temp[1]);
				minScore = Integer.parseInt(temp[2]);
				googScore = new int[googlersNo];
				for(int i = 0;i<googlersNo;i++) {
					googScore[i] = Integer.parseInt(temp[3+i]);
				}
			} catch (Exception e) {
				e.printStackTrace();
				System.exit(1);
			}
		}
		
		private boolean isOverReqScore(int i) {
			int[] temp = {i/3,i/3,i/3};
			int diff = (i-(temp[0]+temp[1]+temp[2]));
			int minDiff = minScore-temp[0];
			if(diff > 0) {
				temp[0] += 1;
				if(diff > 1 && minDiff < 3 && minDiff > 0 && suprScore > 0) {
					temp[0] += 1;
					suprScore--;
				} else if(diff > 1) {
					temp[1] += 1;
				} 
			} else if (minDiff == 1 && temp[0]!=0 && suprScore > 0) {
				temp[0] += 1;
				temp[2] -= 1;
				suprScore--;
			}
			return (temp[0]>=minScore||temp[1]>=minScore||temp[2]>=minScore);
		}
		
		@Override
		public void run() {
			for(int i = 0;i<googlersNo;i++) {
				if(isOverReqScore(googScore[i])) {
					output++;
				}
			}
			stateCalc = true;
		}
		
		public boolean isDone() { 
			return stateCalc;
		}
		
		public void getOutput() {
			System.out.println("Case #"+caseNo+": "+output);
		}
	}