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.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author Chung Lee
 */
public class DanceGoogler {

    public static void Main(String[] args) throws FileNotFoundException {

        Scanner scanner = new Scanner(new File(args[0]));
        PrintWriter writer = new PrintWriter(args[1]);

        int noCase = scanner.nextInt();

        for (int i = 0; i < noCase; i++) {
            int noGooglers = scanner.nextInt();
            int noSurprice = scanner.nextInt();
            int P = scanner.nextInt();

            List<Integer> totalScore = new ArrayList<Integer>();
            List<Integer> noSurpriceBest = new ArrayList<Integer>();
            for (int j = 0; j < noGooglers; j++) {
                int total = scanner.nextInt();
                totalScore.add(total);
                noSurpriceBest.add((int) Math.ceil(total / 3.));
            }
            
            int noAtLeastP = 0;

            for (int j = 0; j < totalScore.size(); j++) {
                if (noSurpriceBest.get(j) >= P) {
                    noAtLeastP++;
                } else if ((totalScore.get(j) % 3 == 0 || totalScore.get(j) % 3 == 2)
                        && totalScore.get(j) != 0
                        && totalScore.get(j) <= 27
                        && noSurpriceBest.get(j) == P - 1
                        && noSurprice > 0) {
                    noSurprice--;
                    noAtLeastP++;
                }
            }
            
            System.out.print(String.format("Case #%d: %d", i + 1, noAtLeastP));
            writer.print(String.format("Case #%d: %d", i + 1, noAtLeastP));
            
            if (i != noCase - 1) {
                System.out.println();
                writer.println();
            }

        }

        writer.close();
    }
}
