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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingWithGoolers {
    public static void main(String args[]) {
        try {
            BufferedReader inputReader = new BufferedReader(new FileReader(
                "input"));
            String line = inputReader.readLine();
            BufferedWriter outWriter = new BufferedWriter(new FileWriter(
                "output.txt"));
            int number = Integer.parseInt(line);
            for ( int i = 1; i <= number; i++ ) {
                String result = "Case #" + i + ": ";
                line = inputReader.readLine();
                String inputs[] = line.split(" ");
                int num = Integer.parseInt(inputs[0]);
                int surprise = Integer.parseInt(inputs[1]);
                int point = Integer.parseInt(inputs[2]);
                int scores[] = new int[num];
                for ( int j = 0; j < num; j++ ) {
                    scores[j] = Integer.parseInt(inputs[3 + j]);
                }
                outWriter.write(result
                    + getResult(num, surprise, point, scores) + "\n");
            }
            outWriter.flush();
            outWriter.close();
        } catch ( FileNotFoundException e ) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        } catch ( IOException e ) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        }
    }

    public static int getResult(int number, int surprise, int point,
        int scores[]) {
        int surpriseLimit = 3 * point - 4;
        if ( surpriseLimit <= 0 ) {
            surpriseLimit = point;
        }
        int acceptableLimit = 3 * point - 2;
        if ( acceptableLimit <= 0 ) {
            acceptableLimit = point;
        }
        int surpriseNum = 0;
        int acceptableNum = 0;
        for ( int i = 0; i < scores.length; i++ ) {
            int score = scores[i];
            if ( score < acceptableLimit && score >= surpriseLimit ) {
                surpriseNum++;
            } else if ( score >= acceptableLimit ) {
                acceptableNum++;
            }
        }
        return acceptableNum + Math.min(surpriseNum, surprise);
    }
}
