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.r0;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * @author julian
 */
public class B {

	public static final void main(String[] args) throws IOException {
		(new B()).run();
	}

	private int getBestRes(int v) {
		return ((v % 3 == 0) ? 0 : 1) + ((int) v / 3);
	}

	private int getBestSurRes(int v) {
		return ((v % 3 == 2) ? 2 : Math.min(v, 1)) + ((int) (v / 3));
	}

	public void run() throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("B-small.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("B.out"));
		int t = Integer.parseInt(in.readLine());
		for (int i = 0; i < t; i++) {
			StringTokenizer stok = new StringTokenizer(in.readLine());
			int n = Integer.parseInt(stok.nextToken());
			int s = Integer.parseInt(stok.nextToken());
			int p = Integer.parseInt(stok.nextToken());
			int[] total = new int[n];
			for (int k = 0; k < n; k++) {
				total[k] = Integer.parseInt(stok.nextToken());
			}
			out.write("Case #" + (i + 1) + ": " + solve(n, s, p, total) + "\n");
		}
		in.close();
		out.flush();
		out.close();
	}

	public int solve(int n, int s, int p, int[] t) {
		int good = 0;
		int soso = 0;
		for (int i = 0; i < n; i++) {
			if (getBestRes(t[i]) >= p) {
				good++;
			} else if (getBestSurRes(t[i]) >= p) {
				soso++;
			}
		}

		return good + Math.min(s, soso);
	}

}
