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

import java.io.*;
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;

/**
 * Created with IntelliJ IDEA.
 * User: kevin
 * Date: 4/13/12
 * Time: 8:00 PM
 * To change this template use File | Settings | File Templates.
 */
public class Dancing {

    public static Iterator<DanceSet> parseSets(String filename) throws IOException {
        File file = new File(filename);
        final BufferedReader reader = new BufferedReader(new FileReader(filename));
        reader.readLine();
        //ehhh unclosed reader =P

        Iterator<DanceSet> itr = new Iterator<DanceSet>() {

            String line=null;
            @Override
            public boolean hasNext() {
                try{

                    line=reader.readLine();
                }   catch (Exception e){
                    throw new RuntimeException(e);
                }
                return line!=null;  //To change body of implemented methods use File | Settings | File Templates.
            }

            @Override
            public DanceSet next() {
                if(line==null)
                    return null;
                String[] split = line.split("\\s");

                int[] numbers = new int[split.length];
                for(int i =0;i<split.length;++i){
                    numbers[i]=Integer.parseInt(split[i]);
                }

                DanceSet set = new DanceSet(numbers[0],numbers[1],numbers[2], Arrays.copyOfRange(numbers,3,numbers.length));

                return set;

            }


            @Override
            public void remove() {
                //To change body of implemented methods use File | Settings | File Templates.
            }
        };
        return itr;

    }

    public static int findMinimumWithLowScore(DanceSet set) {

        int used = 0;
        int answer = 0;
        boolean hasSuprisesLeft = used < set.sunrises;
        int smin = (set.minscore - 2) * 3;
        int min = (set.minscore - 1) * 3;

        if(set.minscore==0)
            return set.dancers;
        for (int score : set.scores) {

            if (score <= smin || score == 0)
                continue;
            if (score > smin && score <= min)
                if (!hasSuprisesLeft) {
                    continue;
                } else {
                    ++used;
                    hasSuprisesLeft = used < set.sunrises;
                }
            ++answer;

        }

        return answer;
    }

    public static void main(String[] argv) throws IOException {
        FileWriter output = new FileWriter("output.dance.txt");
        BufferedWriter writer = new BufferedWriter(output);
        Iterator<DanceSet> itr = parseSets(argv[0]);

        int cnum = 1;
        while(itr.hasNext()){
            int ans= findMinimumWithLowScore(itr.next());
            output.write(String.format("Case #%d: %d\n",cnum++,ans));

        }
        output.close();

    }

}
