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.
 */

import java.util.Scanner;

/**
 *
 * @author leonardo
 */
public class Dance {
    
    static boolean canBeSurprising(int x1, int x2, int x3) {                
        if (x1 > 10 || x2 > 10 || x3 > 10)
            return false ;
        
        return (Math.abs(x1 -x2) >= 2) || (Math.abs(x1 -x3) >= 2) || (Math.abs(x2 -x3) >= 2) ;
    }
    
    /*static boolean canBeSurprising(int r, int x, int p) {                
        boolean[] res = new boolean[2] ;
        
        if (r == 0) {
            return canBeSurprising(x, x, x) || canBeSurprising(x-1, x+1, x) ;           
        }        
        else if (r == 1) {
            return canBeSurprising(x+1, x, x, p, res) || canBeSurprising(x+1, x+1, x-1) ;
        }
        else {
            canBeSurprising(x+2, x, x, p, res);
            canBeSurprising(x, x+1, x+1, p, res) ;        
        }
        return (! res[0] && res[1]) ? 1 : 0;
    }*/

    public static void main(String[] args) {               
        Scanner scanner = new Scanner(System.in) ;
        int inputSize = Integer.parseInt(scanner.nextLine()) ;
                
        for(int i = 1; i <= inputSize; i++) {
            String[] numbers = scanner.nextLine().split(" ") ;
                    
            int n = Integer.parseInt(numbers[0]) ;
            int s = Integer.parseInt(numbers[1]) ;
            int p = Integer.parseInt(numbers[2]) ;
            
            int count = 0 ;
            for(int googler = 0; googler < n; googler++) {
                int score = Integer.parseInt(numbers[googler + 3]) ;
                
                int r = score % 3 ;
                int x = score / 3 ;
                
                if (r == 0) {
                    
                    // possible maxs: x and x + 1
                    
                    if (x >= p)
                        count++ ;
                    else if ((score > 0) && s > 0 && (x + 1) >= p) {
                        s-- ;
                        count++ ;
                    }
                        
                }
                
                // r == 1 -> max = x + 1
                else if (r == 1 && (x + 1 >= p))
                    count++ ;
                
                else {
                                        
                   // possible maxs: x + 1 and x + 2 
                    
                   if ((x + 1) >= p)
                        count++ ;
                   else if ((x+2 <= 10) && (x+2 >= p) && (s > 0)) {
                        count++ ;
                        s-- ;
                    }
                }
            }
            System.out.println("Case #" + i + ": " + count) ;
        }                
    }
}

