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 lk.iit.wall.framework.network;

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * User: Amila
 * Date: 4/13/12
 * Time: 10:48 PM
 * To change this template use File | Settings | File Templates.
 */
public class CodeJamOne {

    public static void main(String[] args) {
        File file = new File("D:\\small.txt");
        try {
            //
            // Create a new Scanner object which will read the data
            // from the file passed in. To check if there are more
            // line to read from it we check by calling the
            // scanner.hasNextLine() method. We then read line one
            // by one till all line is read.
            //
            Scanner scanner = new Scanner(file);
            int cases = scanner.nextInt();
            for (int i = 0; i < cases; i++) {
                int googlers = scanner.nextInt();
                int supprise = scanner.nextInt();
                int max = scanner.nextInt();
                int numGoog = 0;
                int[] nums = new int[googlers];
                for (int j = 0; j < googlers; j++) {
                    int score = scanner.nextInt();
                    nums[j] = score;
                }
                Arrays.sort(nums);
                for (int j = googlers - 1; j >= 0; j--) {
                    int score = nums[j];
                    double d = score / 3f;
                    int div = (int) Math.ceil(d);
                    int mod = score % 3;
                    if (div >= max) {
                        numGoog++;
                        continue;
                    }
                    /*if (mod == 2) {
                        if (div + 2 >= max && supprise != 0 && score > 1 && score < 29) {
                            numGoog++;
                            supprise--;
                            continue;
                        }
                    } else */if(mod==0 || mod == 2){
                        if (div + 1 >= max && supprise != 0 && score > 1 && score < 29) {
                            numGoog++;
                            supprise--;
                            continue;
                        }
                    }
                }
                System.out.println("Case #" + (i + 1) + ": " + numGoog);

            }
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }
}
