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

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author asha.j
 */
public class DancingGooglers {
    
    
    public static void main(String[] args) throws IOException {
        String filename= "B-small-attempt0";
        Scanner scanner= new Scanner(new File("D:\\codejam\\"+filename+".in"));
        BufferedWriter writer= new BufferedWriter(new FileWriter("D:\\codejam\\"+filename+".out"));
        int numOfCases = scanner.nextInt();
        int noOfGooglers;
        int surpriseScoreCount;
        int p;
        int countAboveP=0;
        ArrayList<Integer> list= new ArrayList<Integer>();
        for(int i=1;i<=numOfCases;i++){
            list.clear();
            countAboveP=0;
            noOfGooglers= scanner.nextInt();
            surpriseScoreCount= scanner.nextInt();
            p= scanner.nextInt();
            for(int m=0;m<noOfGooglers;m++){
                    int data= scanner.nextInt();
                    list.add(data);
            }
            countAboveP= processCase(list, surpriseScoreCount, p);
            writer.write("Case #"+(i)+": "+countAboveP+"\n");
            writer.flush();
        }

    }
    
    private static int processCase(ArrayList<Integer> list,int surprising, int p){
        //System.out.println("processCase:"+list+"  sur:"+surprising+" p:"+p);
        int third;
        int reminder;
        int countAboveP=0;
        for(int score: list){
            third= score/3;
            reminder= score%3;
            if(score==0){
                if(p==0){
                    ++countAboveP;
                }
                continue;
            }
            if(third>=p){
                ++countAboveP;
            }else if(reminder==0){
                if(third+1 >=p && surprising>0){
                    --surprising;
                    ++countAboveP;
                }
            }else if(reminder==1){
                if(third+1 >=p){
                    ++countAboveP;
                }
            }else if(reminder==2){
                if(third+1 >=p){
                    ++countAboveP;
                }else if(third+2 >=p && surprising>0){
                    --surprising;
                    ++countAboveP;
                }
            }
        }
        return countAboveP;
    }
}
