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

/**
 * Created with IntelliJ IDEA.
 * User: Frederick
 * Date: 4/14/12
 * Time: 8:36 AM
 * To change this template use File | Settings | File Templates.
 */
public class DancingWithTheGooglers {

    private static int solve(int number, int surprising, int p, int[] totalPoints) {
        int count = 0;
        for (int i = 0; i < number; i++) {
            int total = totalPoints[i];
            if (total >= p * 3) {
                count++;
                continue;
            }
            total -= p;
            if (total < 0) {
                continue;
            }
            int lower = total / 2;
            int higher = total - lower;
            int dif;
            if (lower > p) {
                dif = higher - p;
            } else {
                dif = p - lower;
            }
            if (dif < 2) {
                count++;
            } else if (surprising > 0 && dif == 2) {
                surprising--;
                count++;
            }
        }
        return count;
    }

    public static void main(String[] args) throws IOException {
        File input = new File("C:\\Users\\Frederick\\Downloads\\B-small-attempt0.in");
        File output = new File(input.getAbsolutePath() + ".out");
        BufferedReader in = new BufferedReader(new InputStreamReader(new FileInputStream(input)));
        PrintStream out = new PrintStream(output);
        int cases = Integer.parseInt(in.readLine());
        for (int i = 1; i <= cases; i++) {
            String[] s = in.readLine().split(" ");
            int number = Integer.parseInt(s[0]);
            int surprising = Integer.parseInt(s[1]);
            int p = Integer.parseInt(s[2]);
            int[] totalPoints = new int[number];
            for (int o = 0; o < number; o++) {
                 totalPoints[o] = Integer.parseInt(s[o + 3]);
            }
            int maximum = solve(number, surprising, p, totalPoints);
            String print = "Case #" + i + ": " + maximum;
            System.out.println(print);
            out.println(print);
        }
    }
}
