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.IOException;
import java.io.PrintWriter;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.List;

/* run with JDK7 */
public class DancingWithTheGooglers {

    public static void main(String[] args) throws IOException {
        List<String> input = Files.readAllLines(Paths.get("K:/B-small-attempt0.in"), Charset.defaultCharset());
        PrintWriter output = new PrintWriter("K:/B-small-attempt0.out");
        int testCount = Integer.parseInt(input.get(0));
        for (int i = 1; i <= testCount; ++i) {
            String[] parts = input.get(i).split(" ");
            int n = Integer.parseInt(parts[0]);
            int s = Integer.parseInt(parts[1]);
            int p = Integer.parseInt(parts[2]);
            int[] t = new int[n];
            for (int j = 0; j < n; ++j)
                t[j] = Integer.parseInt(parts[3 + j]);
            // solution
            int alwaysCount = 0, surpriseCount = 0;
            for (int j=0; j<n; ++j) {
                switch (findResult(t[j], p)) {
                    case ALWAYS: ++alwaysCount; break;
                    case SURPRISE: ++surpriseCount; break;
                }
            }
            output.printf("Case #%d: %d\n", i, alwaysCount + Math.min(s, surpriseCount));
        }
        output.close();
    }

    private static Result findResult(int t, int p) {
        int base = t / 3;
        int rem = t - base * 3;
        Result r = null;
        switch (rem) {
            case 0:
                r = tryResult(t, p, base, base, base);
                if (r == null) r = tryResult(t, p, base - 1, base, base + 1);
                break;
            case 1:
                r = tryResult(t, p, base, base, base + 1);
                if (r == null) r = tryResult(t, p, base - 1, base + 1, base + 1);
                break;
            case 2:
                r = tryResult(t, p, base, base + 1, base + 1);
                if (r == null) r = tryResult(t, p, base, base, base + 2);
                break;
            default:
                assert false;
        }
        return r != null ? r : Result.NEVER;
    }

    private static Result tryResult(int t, int p, int a, int b, int c) {
        assert a + b + c == t;
        assert a <= b && b <= c;
        if (a < 0)
            return null;
        if (c >= p) {
            return c - a == 2 ? Result.SURPRISE : Result.ALWAYS;
        }
        return null;
    }

    public enum Result {
        ALWAYS,
        SURPRISE,
        NEVER,
    }
}
