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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package Problem2;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 *
 * @author Mohammed
 */
public class NewDancers {

    static int in[][], out[];

    private static void readFile(String fileName) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader(fileName));
        String line;
        int x = Integer.parseInt(br.readLine());

        in = new int[x][103];
        out = new int[x];

        for (int i = 0; i < x; i++) {
            line = br.readLine();
            StringTokenizer st = new StringTokenizer(line);
            int j = 0;
            while (st.hasMoreTokens()) {
                in[i][j++] = Integer.parseInt(st.nextToken());
            }

        }
    }

    private static void writeOutput(String string) throws IOException {
        BufferedWriter bw = new BufferedWriter(new FileWriter(string));
        for (int i = 0; i < out.length; i++) {
            bw.write("Case #" + (i + 1) + ": " + out[i]);
            if (i != out.length - 1) {
                bw.write("\r\n");
            }
        }
        bw.close();
    }

    public static void main(String[] args) throws FileNotFoundException, IOException {
        readFile("data");
        for (int i = 0; i < in.length; i++) {
            int googlers = in[i][0];
            int surp = in[i][1];
            int p = in[i][2];
            int minCountedTriplet = 3 * p - 2;
            int minCountedTripletWithSur = 3 * p - 4;
            int output = 0;
            for (int j = 3; j < googlers + 3; j++) {
                int temp = in[i][j];
                if (temp >= minCountedTriplet) {
                    output++;
                } else {
                    if (surp > 0 && temp >= minCountedTripletWithSur && minCountedTripletWithSur >= 0) {
                        output++;
                        surp--;
                    }
                }

            }
            out[i] = output;
        }
        writeOutput("output.txt");
    }
}