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 GooglersDance {
	
	boolean surprising = true;
	
	public int maxDancers(int n, int s,int p, int[] t) {
		
		int len = t.length;
		int winners = 0;
		
		for(int i = 0; i < n; i++) {
			
			if(checkWinner(p,t[i],!surprising)) {
				
				winners++;
				continue;
				
			}
			if(s > 0 && checkWinner(p,t[i],surprising)) {
				
				winners++;
				s--;
				
			}
			
		}
		
		return winners;
		
	}

	private boolean checkWinner(int p, int t, boolean surprisingWanted) {
		
		if(!surprisingWanted) {
		
			if(((t-1) % 3) == 0) {
				
				int a = (t-1)/3;
				if(a >= 0 && a+1 >= p) {
					
					return true;
					
				}
				else {
					
					return false;
					
				}
				
			}
			else if(((t-2) % 3) == 0) {
				
				int a = (t-2)/3;
				if(a >= 0 && a+1 >= p) {
					
					return true;
					
				}
				else {
					
					return false;
					
				}
				
			}
			else {
				
				int a = t/3;
				if(a >= p) {
					
					return true;
					
				}
				else {
					
					return false;
					
				}
				
			}
			
		}
		else {
			
			int a = 0;
			switch(t % 3) {
			
			case 0 : 
				a = t/3 - 1;
				break;
			case 1 : 
				a = (t-4)/3;
				break;
			case 2 : 
				a = (t-2)/3;
				break;
			
			}
			if(a >= 0 && a+2 >= p) {
				
				return true;
				
			}
			else {
				
				return false;
				
			}
			
		}
		
		
	}

}
