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

public class dance {

    public static void main(String[] args) throws IOException {
        String filename="sample.txt";
        
        
        
        FileInputStream fstream = new FileInputStream(filename);
        DataInputStream in = new DataInputStream(fstream);

       FileWriter fstreamout = new FileWriter("out.txt");
       BufferedWriter out = new BufferedWriter(fstreamout);

       int n= Integer.parseInt(in.readLine());
      // System.out.println(n);
       for(int i=0;i<n;i++){
       
	   String test = in.readLine();
       String [] temp = test.split(" ");
	   int [] array = new int[temp.length-3];
       int num = Integer.parseInt(temp[0]);
       int sur = Integer.parseInt(temp[1]);
       int p = Integer.parseInt(temp[2]);
	   int count =0;
       //System.out.println(num+" "+sur+" "+p);
       for(int j=0;j<temp.length-3;j++){
       array[j]=Integer.parseInt(temp[3+j]);
       //System.out.println(array[j]);
	   }
      //Arrays.sort(array);

		for(int j=num-1;j>=0;j--){
		
			if(array[j]%3 == 0){
			
                if(array[j]/3 >= p) 
				count++;
				
                else if((array[j]+3)/3 >= p && sur>=1 && array[j]>=3)
				{ count++; sur--;}
				
				else ;
			}

           else if(array[j]%3 == 1)
           {
            if(((array[j]+2)/3) >= p && array[j]>=1) count++;
			else ;            

            }

            else 
           {
            if(((array[j]+1)/3) >= p && array[j]>=2) count++;
            else if(((array[j]+4)/3) >= p && sur>=1 && array[j]>=2) {count++; sur--;}
			else ;
            
            }

       }
       //kmkn
       out.write("Case #"+(i+1)+": "+count+"\n");
       }
		in.close();
       out.close();


       }
    }

