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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

/**
 * GoogleDancers Class
 * 
 * @author ndiwan
 * 
 */
public class GoogleDancers {

	/**
	 * Main method for calculating best results of Google dancers
	 * 
	 * @param args
	 */
	public static void main(String[] args) {

		int testCases;
		int googlers;
		int surprising;
		int cutOff;
		int[] marks;
		int bestResult = 0;

		BufferedWriter bw = null;
		Scanner scan = null;

		try {

			bw = new BufferedWriter(new FileWriter("Output.txt"));
			scan = new Scanner(new File("Input.txt"));

			testCases = scan.nextInt();

			for (int i = 1; i <= testCases; i++) {

				googlers = scan.nextInt();
				surprising = scan.nextInt();
				cutOff = scan.nextInt();
				bestResult = 0;

				marks = new int[googlers];

				// storing marks for googlers
				for (int j = 0; j < googlers; j++) {
					marks[j] = scan.nextInt();
				}

				// processing marks in triplets
				for (int k = 0; k < marks.length; k++) {

					int div = marks[k] / 3;
					int rem = marks[k] % 3;

					if (div != 0) {
						if (div >= cutOff) {
							++bestResult;
						} else {
							if (cutOff - div == 1) {
								if (rem >= 1) {
									++bestResult;
								} else if (surprising > 0) {
									++bestResult;
									--surprising;
								}
							}
							if (cutOff - div == 2 && rem > 1 && surprising > 0) {
								++bestResult;
								--surprising;
							}
						}
					}
					else {
						if (cutOff == 0 || rem >= cutOff){
							++bestResult;
						}
						else if (rem >= cutOff && surprising > 0) {
							++bestResult;
							--surprising;
						}
					}
				}

				bw.write("Case #" + i + ": " + bestResult + "\n");
			}

		} catch (Exception e) {
			System.out.println("Exception " + e);
			e.printStackTrace();
			
		} finally {
			scan.close();
			try {
				bw.close();
			} catch (Exception e) {
				e.printStackTrace();
			}
		}
	}
}