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.*;

public class Dancing {
    private final int[] total_scores;
    private final int superising_count;

    public Dancing(int[] total_scores, int superising_count) {
        this.total_scores = total_scores;
        this.superising_count = superising_count;
    }

    public static void main(String[] args) throws IOException {
        InputStream is;
        if (args.length > 0) {
            is = new FileInputStream(args[0]);
        }else{
            is = System.in;
        }

        BufferedReader inputReader = new BufferedReader(new InputStreamReader(is));
        String firstLine = inputReader.readLine();
        int count_of_cases = Integer.parseInt(firstLine);

        for (int idx_of_case = 1; idx_of_case <= count_of_cases; idx_of_case++) {
            String caseLine = inputReader.readLine();
            String[] numbers = caseLine.split(" ");

            int numbers_of_googler = Integer.parseInt(numbers[0]);
            int superising_count = Integer.parseInt(numbers[1]);
            int at_least = Integer.parseInt(numbers[2]);

            int[] total_scores = new int[numbers_of_googler];
            for (int idx = 0; idx < numbers_of_googler; idx++) {
                total_scores[idx] = Integer.parseInt(numbers[3+idx]);
            }

            int count = new Dancing(total_scores, superising_count).count_of_greater_than(at_least);

            System.out.println(String.format("Case #%d: %d", idx_of_case, count));
        }

    }

    public int count_of_greater_than(int at_least) {
        int supersed_count = 0;
        int count=0;
        for (int idx = 0; idx < total_scores.length; idx++) {
            int score = total_scores[idx];

            int max_score = 0;
            int average = score / 3;
            if (average * 3 == score) {
                max_score = average;
            }else{
                max_score = average+1;
            }

            if (max_score >= at_least) {
                count++;
            }else{
                int left = score - at_least;
                if (left > 0 && supersed_count < superising_count ) {
                    if ((left / 2) * 2 == left && at_least - left / 2 == 2) {
                        supersed_count++;
                        count++;
                    }
                    if (left == 2 * at_least -3 ) {
                        supersed_count++;
                        count++;
                    }
                }
            }


        }
        return count;

    }
}
