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 CodeJam2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;

public class Q2 {

	public static void main(String[] args) throws IOException {
		FileReader buf = new FileReader("Input.in");
		BufferedReader br = new BufferedReader(buf);
		int cases = Integer.parseInt(br.readLine());
		String[] outputs = new String[cases];
		for (int i = 1; i <= cases; i++) {
			String input = br.readLine();
			String[] splits = input.split(" ");
			int N = Integer.parseInt(splits[0]);
			int S = Integer.parseInt(splits[1]);
			int p = Integer.parseInt(splits[2]);
			int thresh = 0;
			int special = S;
			int[] points = new int[splits.length - 3];
			for (int k = 0; k < points.length; k++) {
				points[k] = Integer.parseInt(splits[k + 3]);
			}
			for (int j = 0; j < points.length; j++) {
				int v = (int) (points[j] / 3);
				int rem = points[j] % 3;
				switch (rem) {
				case 2:
					if (v + 1 >= p || v >= p) {
						thresh++;
					} else if (special > 0 && v + 2 >= p) {
						thresh++;
						special--;
					}
					break;
				case 1:
					if (v >= p || v + 1 >= p) {
						thresh++;
					} else if (special > 0 && v + 1 >= p) {
						thresh++;
						special--;
					}
					break;
				case 0:
					if (v >= p) {
						thresh++;
					} else if (special > 0 && v > 0 && v + 1 >= p) {
						thresh++;
						special--;
					}
					break;
				}

			}
			if (i != cases)
				outputs[i - 1] = "Case #" + i + ": " + thresh + "\n";
			else
				outputs[i - 1] = "Case #" + i + ": " + thresh;
		}
		br.close();
		buf.close();
		FileWriter buf1 = new FileWriter(new File("OutputDance.txt"), true);
		BufferedWriter bw1 = new BufferedWriter(buf1);
		for (int i = 0; i < cases; i++) {
			bw1.write(outputs[i]);
		}
		bw1.close();
		buf1.close();

	}

}
