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 com.jam.contest2012;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class Dancing {

    public static int foo(final List<Integer> list, final int surprise,
	    final int p) {
	return find_max(new ArrayList<Integer>(), list, surprise, p);
    }

    private static int find_max(final ArrayList<Integer> unexpected,
	    final List<Integer> expected, final int surprise, final int p) {
	if (surprise == 0) {
	    return countExpected(expected, p) + countUnexpected(unexpected, p);
	}
	int max = Integer.MIN_VALUE;
	for (int i = 0; i < expected.size(); i++) {
	    if (expected.get(i) == 0)
		continue;
	    unexpected.add(0, expected.remove(i));
	    final int local = find_max(unexpected, expected, surprise - 1, p);
	    if (local > max) {
		max = local;
	    }
	    expected.add(i, unexpected.remove(0));
	}
	return max;
    }

    private static int countExpected(final List<Integer> expected, final int p) {
	int result = 0;
	for (final Integer $ : expected) {
	    switch ($ % 3) {
	    case 0: {
		if (($ / 3) >= p)
		    ++result;
		break;
	    }
	    case 1: {
		if ((($ + 2) / 3) >= p)
		    ++result;
		break;
	    }

	    case 2: {
		if ((($ + 1) / 3) >= p)
		    ++result;
		break;
	    }
	    }
	}
	return result;
    }

    private static int countUnexpected(final List<Integer> unexpected,
	    final int p) {
	int result = 0;
	for (final Integer $ : unexpected) {
	    switch ($ % 3) {
	    case 0: {
		if ((($ + 3) / 3) >= p)
		    ++result;
		break;
	    }
	    case 1: {
		if ((($ + 2) / 3) >= p)
		    ++result;
		break;
	    }

	    case 2: {
		if ((($ + 4) / 3) >= p)
		    ++result;
		break;
	    }
	    }
	}
	return result;
    }

    public static void main(final String[] args) {
	BufferedReader reader = null;
	try {
	    reader = new BufferedReader(new FileReader(new File(
		    "/home/artem/B-small-attempt0.in")));
	    final Integer numberOfCases = Integer.valueOf(reader.readLine());
	    for (int i = 1; i <= numberOfCases; ++i) {
		final String sentense = reader.readLine();
		final String[] tokens = sentense.split(" ");
		final int surprise = Integer.valueOf(tokens[1]);
		final int p = Integer.valueOf(tokens[2]);
		final List<Integer> list = new ArrayList<Integer>();
		for (int k = 3; k < tokens.length; ++k)
		    list.add(Integer.valueOf(tokens[k]));
		System.out
			.println("Case #" + i + ": " + foo(list, surprise, p));
	    }
	} catch (final Exception e) {
	    e.printStackTrace();
	} finally {
	    if (reader != null)
		try {
		    reader.close();
		} catch (final IOException e) {
		}
	}

    }

}