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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj2012;

/**
 *
 * @author allegea
 */
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;

/**
 *
 * @author Allegea
 */
public class DancingWiththeGooglers {
 
    public static void main(String[] args) throws IOException,FileNotFoundException{
        
        
        
        String name = "B-small-attempt0";
        
        BufferedReader in   = new BufferedReader(new FileReader(name+".in"));
        
        // BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        FileWriter archivo = new FileWriter(name+".out");
        PrintWriter out = new PrintWriter(archivo);
        out.flush();

       
         
           String line;
           StringBuilder buil = new StringBuilder();
           line = in.readLine();
           int cases = Integer.parseInt(line);
           int act = 0;
            while (act++<cases) 
            {
                
                StringTokenizer x = new StringTokenizer(in.readLine());
                int n= Integer.parseInt(x.nextToken());
                int p = Integer.parseInt(x.nextToken());
                int max = Integer.parseInt(x.nextToken());
                int[] s = new int[n];
                for(int i=0;i<n;i++)
                    s[i] = Integer.parseInt(x.nextToken());
                

                int count=0;
                int sup = 0;
                for(int i=0;i<n;i++){
                    int avg = s[i]/3;
                    int res = s[i]-avg*3;
                    //System.out.println(avg+" - "+res+" - "+s[i]);
                    
                    if(avg==0){
                        if(s[i]>=max)count++;
                        continue;
                    }
                    if(avg>=max)
                    {
                        count++;
                        continue;
                    }
                    
                    if(res==0)
                    {
                        if(avg+1==max)sup++;
                    }else if (res ==1){
                        if(avg+1==max)count++;
                    }else{
                        if(avg+1==max)count++;
                        else if(avg+2==max)sup++;
                    }

                }
                //System.out.println(sup+" - "+count);
                count+=Math.min(p, sup);
                
                
                
                System.out.println("Case #"+act+": "+count);
               out.println("Case #"+act+": "+count);
              // System.out.println(line); 
                
            }


        in.close();
        out.close();
        System.exit(0);

        

        
        
    }
   


}

