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.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;


public class Dancing {


	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner read = new Scanner(new InputStreamReader(System.in));
		int cases = Integer.parseInt(read.next());
		int counter =1;
		while(cases>0){
			int n = Integer.parseInt(read.next());
			int s = Integer.parseInt(read.next());
			int p = Integer.parseInt(read.next());
			int bests = 0;
			int p2 =0;
			int googler;
			for(int i=0; i<n; i++){
				 googler = Integer.parseInt(read.next());
				 int x = googler/3;
				 if(googler == 1 || googler ==2 || googler == 0 ){
					 if(googler == 1 && 1>=p)
						 bests++;
					 else if(googler == 2){
						 if(1>=p)
							 bests++;
						 else if(2 >= p && p2<s){
							 bests++;
							 p2++;
						 }
					 }else if( googler == 0 && 0>=p)
						 bests++;
				 }else{
					 if((x*3) == googler){
						 if(x>=p)
							 bests++;
						 else if((x+1)>= p && p2<s){
							 bests++;
							 p2++;
						 }
						 
					 }else if((x+x+x+1)== googler){
						 if((x+1) >= p )
							 bests++;
					 }else if((x+x+x+2) == googler){
						 if((x+1)>=p)
							 bests++;
						 else if((x+2)>=p && p2<s){
							 bests++;
							 p2++;
						 }
					 }
				 }
			}
			System.out.println("Case #"+counter+": "+bests);
			cases--;
			counter++;
		}
		

	}

}
