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.google.codejam;

import java.io.DataOutputStream;
import java.io.File;
import java.io.FileOutputStream;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.regex.Pattern;

public class CodeJam2 {
	private static int N, P, S;
	private static int inputNumbers[];
	private static int testCase;
	private static FileOutputStream fostream;
	private static DataOutputStream out;

	public static void main(String[] args) {

		try {
			fostream = new FileOutputStream("output2.out");
			out = new DataOutputStream(fostream);
			Scanner scanner = new Scanner(new File("B-small-attempt0.in"));
			String inputNumberline = scanner.nextLine();
			testCase = Integer.parseInt(inputNumberline);
			for (int i = 0; i < testCase; i++) {
				filterString(scanner.nextLine(), i);
			}
			out.close();
		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());
		}

	}

	private static void filterString(String fstring, int caseNumber) {

		final Pattern SPACE = Pattern.compile(" ");
		ArrayList<Integer> myList = new ArrayList<Integer>();
		ArrayList<Integer> baseList = new ArrayList<Integer>();
		int i = 0;
		for (String token : SPACE.split(fstring)) {
			try {
				if (i == 0) {
					inputNumbers = new int[Integer.parseInt(token) + 3];
					inputNumbers[i] = Integer.parseInt(token);
					i++;
				} else {
					inputNumbers[i] = Integer.parseInt(token);
					i++;
				}
			} catch (NumberFormatException ex) {
				System.err.println(token + " is not a number");
			}
		}

		P = inputNumbers[2];
		S = inputNumbers[1];
		N = inputNumbers[0];

		for (int j = 3; j < inputNumbers.length; j++) {
			myList.add(inputNumbers[j]);
			baseList.add(inputNumbers[j] / 3);

		}

		int mod[] = new int[N];
		int count;
		count = 0;
		for (int l = 0; l < N; l++) {
			mod[l] = myList.get(l) % 3;
			switch (mod[l]) {
			case 0:
				if (baseList.get(l) >= P)
					count++;
				else {
					if (S > 0 && baseList.get(l) > 0
					&& baseList.get(l) + 1 >= P) {
						count++;
						S--;
					}
				}
				break;
			case 1:
				if (baseList.get(l) >= P || baseList.get(l) + 1 >= P) {
					count++;
				} else {
					if (baseList.get(l) > 0 && baseList.get(l) + 1 >= P) {
						count++;
						S--;
					}
				}
				break;
			case 2:
				if (baseList.get(l) + 1 >= P || baseList.get(l) >= P) {
					count++;
				} else {
					if (S > 0 && baseList.get(l) + 2 >= P) {
						count++;
						S--;
					}
				}
				break;

			}
		}

		System.out.println("Case #" + (caseNumber + 1) + ": " + count);
		try {
			out.writeBytes("Case #" + (caseNumber + 1) + ": " + count + "\n");
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} }

}



