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 test;
import java.io.*;

public class Test {
	
	static public void magic(String tmp, int Result [],int index ){
		int N=0,S=0,P=0,size;
		char Carr []= new char[300];
		size=tmp.length();
		tmp.getChars(0, size, Carr, 0);
		
		int i=0,j=0,spc=0;
		String bom;
		while (spc<3){
			
			if(Carr[j]!=' '){
				j++;
			}else{
				bom=tmp.substring(i, j);
				if(spc==0)
					N=Integer.parseInt(bom);
				if(spc==1)
					S=Integer.parseInt(bom);
				if(spc==2)
					P=Integer.parseInt(bom);
				spc++;
				j++;
				i=j;
			}
		}
		
		int counter=N;
		int bomnum,nosur,sur,ans=0;
		nosur=((P-1)*2)+P;
		sur=((P-2)*2)+P;
		if(sur<0)
			sur=1;
		while (counter>0){
			if(Carr[j]!=' '&&j<size){
				j++;
			}else{
				bom=tmp.substring(i, j);
				bomnum=Integer.parseInt(bom);
				if(bomnum>=nosur){
					ans++;
				}else if(bomnum>=sur && S>0){
					ans++;
					S--;
				}
				j++;
				i=j;
				counter--;
			}
		}
		
		Result[index]=ans;
		
	}
	
	public static void main(String[] args) {
		
		////////
		int index=0,T,casenum=1,j;
		String tmp;
		
		int Result[]=new int [101];
		
		////////
		
		BufferedReader reader;
		reader = new BufferedReader(new InputStreamReader(System.in));
		try {
			tmp = reader.readLine();
			T=Integer.parseInt(tmp);
			
			j=T;
			while(j!=0){
				tmp = reader.readLine();
				magic (tmp,Result,index);
				
				index++;
				j--;
			}
			
			j=T;
			while(j!=0){
				System.out.println("Case #"+casenum+": "+Result[casenum-1]);
				casenum++;
				j--;
			}
			
			
		} catch (IOException e) {
			e.printStackTrace();
		}	
	}
}
