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

public class GooglerDance {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int size = in.nextInt();
		int count = 0;
		while (count < size) {
			int maxNum = 0;
			int googlers = in.nextInt();
			int[][] judges = new int[googlers][3];
			int[] scores = new int[googlers];
			boolean[] ishigher = new boolean[googlers];
			int s = in.nextInt();
			int p = in.nextInt();
			for (int i = 0; i < scores.length; i++) {// getting scores
				scores[i] = in.nextInt();
			}
			// computing scores
			for (int i = 0; i < scores.length; i++) {
				int ceil = scores[i] / 3;
				if ((scores[i] % 3) > 0) {
					ceil++;
				}
				if (ceil >= p) {
					ishigher[i] = true;
					maxNum++;
				}
				if ((3 * ceil) == scores[i]) {
					judges[i][0] = ceil;
					judges[i][1] = ceil;
					judges[i][2] = ceil;
					if (!ishigher[i] && (p - ceil) == 1 && s > 0
							&& (ceil - 1) > 0) {
						judges[i][0] = ceil + 1;
						judges[i][1] = ceil;
						judges[i][2] = ceil - 1;
						maxNum++;
						s--;
					}
				} else if ((3 * ceil) == (scores[i] + 1)) {
					judges[i][0] = ceil;
					judges[i][1] = ceil;
					judges[i][2] = ceil - 1;
					if (!ishigher[i] && (p - ceil) == 1 && s > 0
							&& (ceil - 1) > 0) {
						judges[i][0] = ceil + 1;
						judges[i][1] = ceil - 1;
						judges[i][2] = ceil - 1;
						maxNum++;
						s--;
					}
				} else if ((3 * ceil) == (scores[i] + 2)) {
					judges[i][0] = ceil;
					judges[i][1] = ceil - 1;
					judges[i][2] = ceil - 1;

				} else {
					System.out.println("Error in Algorithm");
				}
			}
			System.out.format("Case #%d: %d\n", count + 1, maxNum);
			count++;
		}
	}
}
