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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

import javax.swing.text.html.MinimalHTMLWriter;


public class B {

	
	public static void main(String[] args) throws FileNotFoundException {
		
		//File fich = new File("C:\\b-teste.in");
		File fich = new File("C:\\B-small-attempt5.in");
		Scanner input = new Scanner(fich);

		int num_googlers, num_surp, score_min;
		
		int num_casos, resultado, tmp, resto;

		num_casos = input.nextInt();
		
		for(int i = 0; i < num_casos; i++){
			resultado = 0;
			
			num_googlers = input.nextInt(); 
			num_surp = input.nextInt();
			score_min  = input.nextInt();

			int googlers[] = new int[num_googlers];
			
			for(int j = 0; j < num_googlers; j++){
				googlers[j] = input.nextInt();
			
				if (score_min == 0){
					resultado++;
					continue;
				}
				
				if (googlers[j] == 0) 
					continue;
				
				
				tmp = googlers[j] / 3;
				resto = googlers[j] % 3;
		
				if (resto == 0){
				
					if (tmp >= score_min)
						resultado++;
					else if (num_surp > 0 && tmp + 1 >= score_min){
						resultado++;
						num_surp--;
					}
				}else if (resto == 1 ){
					
					if (tmp + 1 >= score_min)
						resultado++;
					else if (num_surp > 0 && tmp + 1 >= score_min){
						resultado++;
						num_surp--;
					}	
					
				}else if (resto == 2){
					
					if (tmp + 1 >= score_min)
						resultado++;
					else if (num_surp > 0 && tmp + 2 >= score_min){
						resultado++;
						num_surp--;
					}
					
				}
	
			}
			
			System.out.println("Case #" + (i+1) + ": " + resultado);
			
		}
		
	}

}
