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

import java.io.*;
import java.util.Scanner;

public class DancingWithGooglers {

    public static final String LINE_SEPARATOR = System.getProperty("line.separator");

    public static int getNum(int n, int s, int p, int[] points) {
        return getNum(0, n, s, p, points);
    }

    public static int getNum(int i, int n, int s, int p, int[] points) {
        if (i == n) return 0;
        
        int point = points[i];

        int x = point / 3;
        
        int res1 = 0, res2 = 0;
        
        if (point % 3 == 0) {
            //x x x
            if (x >= p) {
                res1++;
            }
            res1 += getNum(i+1, n, s, p, points);

            // x-1 x x+1 (s)
            if (x > 0 && s > 0) {
                if (x+1 >= p) {
                    res2++;
                }
                res2 += getNum(i+1, n, s - 1, p, points);
            }
        } else if (point % 3 == 1) {
            //x x x+1
            if (x+1 >= p) {
                res1++;
            }
            res1 += getNum(i+1, n, s, p, points);

            //x-1 x+1 x+1
            if (x > 0 && s > 0) {
                if (x+1 >= p) {
                    res2++;
                }
                res2 += getNum(i+1, n, s-1, p, points);
            }
        } else if (point % 3 == 2) {
            //x x+1 x+1
            if (x+1 >= p) {
                res1++;
            }
            res1 += getNum(i+1, n, s, p, points);
            //x x x+2
            if (s > 0) {
                if (x+2 >= p) {
                    res2++;
                }
                res2 += getNum(i+1, n, s-1, p, points);
            }
        }

        return Math.max(res1, res2);
    }

    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(new File("D:\\codejam\\B-small-attempt1.in"));
        Writer writer = new OutputStreamWriter(new FileOutputStream("D:\\codejam\\B-small1.out"));
        Integer t = Integer.valueOf(scanner.nextLine());
        for (int i = 1; i <= t; i++) {
            System.out.println();
            int n = scanner.nextInt();
            int s = scanner.nextInt();
            int p = scanner.nextInt();
            int[] points = new int[n];
            for (int j = 0; j < n; j++)
                points[j] = scanner.nextInt();
            writer.write("Case #" + i + ": " + getNum(n, s, p, points));
            writer.write(LINE_SEPARATOR);
        }
        scanner.close();
        writer.close();
    }
}
