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 gs.taral.gcj2012;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class Dancing {
	public static void main(String[] args) throws NumberFormatException, IOException {
		List<String> input = readInput(args[0]);
		List<String> output = solve(input);
		writeOutput(args[1], output);
	}

	private static String solveCase(String line) {
		String[] tokens = line.split(" ");
		int n = Integer.parseInt(tokens[0]);
		int s = Integer.parseInt(tokens[1]);
		int p = Integer.parseInt(tokens[2]);
		int[] t = new int[n];
		for (int i = 3; i < tokens.length; i++)
			t[i - 3] = Integer.parseInt(tokens[i]);
		int definitely = 0;
		int possibly = 0;
		for (int score : t) {
			if (score >= 3 * p - 2)
				definitely++;
			else if (p > 1 && score >= 3 * p - 4 )
				possibly++;
		}
		int result = definitely + Math.min(possibly, s);
		return String.valueOf(result);
	}

	private static List<String> solve(List<String> input) {
		List<String> output = new ArrayList<String>();
		for (String line : input)
			output.add(solveCase(line));
		return output;
	}

	private static List<String> readInput(String filename) throws FileNotFoundException,
			IOException {
		BufferedReader in = new BufferedReader(new FileReader(filename));
		List<String> input = new ArrayList<String>();
		int n = Integer.parseInt(in.readLine());
		while (true) {
			String line = in.readLine();
			if (line == null)
				break;
			input.add(line);
		}
		if (input.size() != n)
			throw new IllegalArgumentException();
		return input;
	}

	private static void writeOutput(String filename, List<String> output) throws IOException {
		PrintWriter out = new PrintWriter(new FileWriter(filename));
		for (int i = 0; i < output.size(); i++) {
			int caseNumber = i + 1;
			String line = output.get(i);
			out.println("Case #" + caseNumber + ": " + line);
		}
		out.close();
	}
}
