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.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;


public class Dance {

	public int run ( int N, int S, int p, int[] G ) {
		
		int results = 0;
		
		java.util.Arrays.sort( G );
		
		for( int i = G.length -1; i >= 0; --i ) {
			
			int t = G[ i ];
			
			int r = t % 3;
			
			int x = t / 3;
			
			if ( r == 0 ) {
				 //  x + x + x 
				 // ( x + 1 ) + x + ( x -1 ) ***
				if ( x >= p ) {
					
					++results;
 
					continue;
				}

				if ( t > 0 && x + 1 >= p && S > 0) {
					
					--S;
					
					++results;
					
					continue;
				}
				
				break;
			}
			
			if ( r == 1 ) {
				// ( x + 1) + x + x
				// No surpising because max range 2 ***  
				if ( x + 1 >= p ) {
					
					++results;
					
					continue;
				}

				break;
			}
			
			if ( r == 2 ) {
				// ( x + 1) + (x + 1) + x
				// ( x + 2 ) + x + x
				if ( x + 1 >= p ) {
					
					++results;
					
					continue;
				}

				if ( x + 2 >= p && S > 0) {
					
					--S;
					
					++results;
					
					continue;
				}
				
				break;
			}
		}
		
		return results;		
	}
	
	public Dance( String input ) throws Exception {
			
		FileInputStream fstream = new FileInputStream(input);
		
		DataInputStream in = new DataInputStream(fstream);
		
		BufferedReader br = new BufferedReader(new InputStreamReader(in)); 
		
		int t = Integer.parseInt( br.readLine() ); 
		
		for( int i = 1; i <= t; i++ ) {
	
			String test = br.readLine(); 
			
			String[] tokens = test.split( " " );
			
			int N = Integer.parseInt( tokens[0] );
			
			int S = Integer.parseInt( tokens[1] );
			
			int p = Integer.parseInt( tokens[2] );
			
			int[] G = new int[N];
			
			for( int j = 0; j < N; ++j ) {
				
				G[ j ] = Integer.parseInt( tokens[ 3 + j ] ); 
			} 
			
			System.out.print( "Case #" );
			
			System.out.print( i ); 
			
			System.out.print( ": " );
			
			System.out.println( run( N, S, p, G ) );
		}  
	
		in.close(); 
	}
	
	
	public static void main( String[] args ) throws Exception {
		
		new Dance( "dance-test.in" );
	}
}
