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

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class BSmall {
	public static void get() {
		try {
			File inputFile = new File("B-small-attempt3.in");
			inputFile.createNewFile();
			Scanner scan = new Scanner(inputFile);
			int t = Integer.parseInt(scan.nextLine());
			File out = new File("out.txt");
			FileWriter fw = new FileWriter(out);
			for (int i = 0; i < t - 1; i++) {
				fw.append("Case #" + (i + 1) + ": ");
				int counter = 0;
				int n = scan.nextInt();
				int s = scan.nextInt();
				int p = scan.nextInt();

				for (int j = 0; j < n; j++) {
					int g1 = scan.nextInt();
					if (g1 == 0 && p > 0) {
						continue;
					}

					if (p > 0) {
						int key = g1 / p;

						if (key >= 3) {
							counter++;
						} else {
							if (key == 2) {
								int talet = p + (g1 % p);
								int v = talet / 2;
								if (p - v == 1) {
									counter++;
								} else {
									if (p - v == 2 && s > 0) {
										counter++;
										s--;
									}
								}
							} else {
								int x = g1 - p;
								x = x / 2;
								if (p - x == 1) {
									counter++;
								} else {
									if (p - x == 2 && s > 0) {
										s--;
										counter++;
									}

								}
							}

						}
					} else {
						counter++;
					}

				}
				fw.append("" + counter + "\n");
			}

			fw.append("Case #" + (t) + ": ");
			int counter = 0;
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();

			for (int j = 0; j < n; j++) {
				int g1 = scan.nextInt();
				if (p > 0) {
					int key = g1 / p;

					if (key >= 3) {
						counter++;
					} else {
						if (key == 2) {
							int talet = p + g1 % p;
							int v = talet / 2;
							if (p - v == 1) {
								counter++;
							} else {
								if (p - v == 2 && s > 0) {
									counter++;
									s--;
								}
							}
						}

					}
				} else {
					counter++;
				}
			}
			fw.append("" + counter);
			fw.close();

		} catch (Exception e) {

		}
	}

	public static void main(String[] args) {
		get();
	}

}
