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.util.Scanner;

public class B {
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("input.in"));
		int t, n, s, p, ans;
		int scores[];
		t = in.nextInt();
		for (int tc = 1; tc <= t; tc++) {
			n = in.nextInt();
			s = in.nextInt();
			p = in.nextInt();
			ans = 0;
			scores = new int[n];
			for (int i = 0; i < scores.length; i++) {
				scores[i] = in.nextInt();
			}

			for (int i = 0; i < scores.length; i++) {
				if (scores[i] == 0 && p != 0)
					continue;
				if (scores[i] / 3 >= p) {
					ans++;
					continue;
				}
				if ((double) scores[i] / 3 == scores[i] / 3) {
					if (p - scores[i] / 3 == 1 && s > 0) {
						ans++;
						s--;
						continue;
					}
				} else {
					double temp = (double) scores[i] / 3;
					if (scores[i] - 3 * Math.floor(temp) < 2
							&& scores[i] - 2 * Math.floor(temp) >= p)
						ans++;
					else if (scores[i] - 3 * Math.ceil(temp) < 2
							&& (scores[i] - 2 * Math.ceil(temp) >= p || Math
									.ceil(temp) >= p))
						ans++;
					else if (scores[i] - 3 * Math.floor(temp) == 2 && s != 0
							&& scores[i] - 2 * Math.floor(temp) >= p) {
						ans++;
						s--;
					} else if (scores[i] - 3 * Math.ceil(temp) == 2 && s != 0
							&& scores[i] - 2 * Math.ceil(temp) >= p) {
						ans++;
						s--;
					}
				}

			}
			System.out.println("Case #" + tc + ": " + ans);

		}
	}
}
