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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWiththeGooglers {

	public static void main ( String [] arg ) throws IOException{
		BufferedReader reader = new BufferedReader(new FileReader(new File("input")));
		PrintWriter output = new PrintWriter(new File("output"));
		int cases = Integer.valueOf( reader.readLine() ); 
		for ( int i=1; i<=cases; i++ ){
			StringTokenizer tkn = new StringTokenizer( reader.readLine() ); 
			int N = Integer.valueOf( tkn.nextToken() ); 
			int S = Integer.valueOf( tkn.nextToken() ); 
			int p = Integer.valueOf( tkn.nextToken() ); 
			int sol=0; 
			for ( int j=0; j<N; j++){
				int points = Integer.valueOf( tkn.nextToken() ); 
				if ( ok(points,p,3) ){
					sol++;
				} else {
					if ( S>0 && ok(points,p,4) ){
						sol++;
						S--;
					}
				}
			}
			output.println("Case #"+i+": " + sol ); 
		}
		output.close(); 
	}
	
	public static boolean ok( int suma, int p, int sum_delta ){
		for ( int i=0; i<=10; i++ ){
			for ( int j=0; j<=10; j++ ){
				for ( int k=0; k<=10; k++ ){
					if ( i+j+k == suma ){
						int unu =  Math.abs(i-j);
						int doi =  Math.abs(i-k);
						int trei = Math.abs(j-k);
						if ( unu+doi+trei<=sum_delta ){
							if ( Math.max( Math.max(i, j), k )>=p){
								return true; 
							}
						}
					}
				}
			}
		}
		return false; 
	}
	
}
