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

package codejam2012;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;

/**
 * Created by IntelliJ IDEA.
 * User: Jimmy
 * Date: 4/14/12
 * Time: 10:17 PM
 */
public class DancingWithTheGooglers implements Runnable {

    Scanner scanner;
    PrintWriter pw;

    public static void main(String arguments[]) {
        new Thread(new DancingWithTheGooglers()).start();
    }

    public static boolean isSurprising(int points) {
        return points > 1 && points < 29;
    }

    public static int ms(int points) {
        return (points + 4) / 3;
    }

    public static int mn(int points) {
        return (points + 2) / 3;
    }

    public void solution() {
        int t = scanner.nextInt();

        int i, n, s, p, j;
        int points;
        int d;
        int r = 0;
        int result;
        for(i = 1; i <= t; i++) {
            n = scanner.nextInt();
            s = scanner.nextInt();
            p = scanner.nextInt();

            System.out.println(n + " " + s + " " + p);

            int sum1 = 0;
            int sum2 = 0;

            for(j = 0; j < n; j++) {
                r = 0;
                points = scanner.nextInt();
                if(isSurprising(points)) {
                    int ms = ms(points);
                    int mn = mn(points);

                    if (ms >= p && mn < p)
                        sum1++;

                    else if (mn >= p)
                        sum2++;
                } else {
                    if (mn(points) >= p)
                        sum2++;
                }
            }
            System.out.println("******************************************************");
            pw.println("Case #" + i + ": " + (Math.min(s, sum1) + sum2));
        }
    }

    public void run() {
        scanner = new Scanner(System.in);
        try {
            pw = new PrintWriter(new File("output.txt"));
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }

        solution();

        pw.close();
        scanner.close();
    }
}
