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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;

public class B {
	final static String CASE_NO = "Case #";
	final static String SUFFIX = ": ";

	/**
	 * @param args
	 * @throws Exception
	 */
	public static void main(String[] args) throws Exception {
		int total;
		int T; // nuber of test cases
		int N; // number of googlers
		int S; // number of surprising triplets
		int P;

		BufferedReader br = readFile("B-small.txt");

		T = Integer.parseInt(br.readLine());
		total = T;
		while (T > 0) {
			T--;
			String line = br.readLine();
			String[] input = line.split(" ");
			int i = 0;
			N = Integer.parseInt(input[i++]);
			S = Integer.parseInt(input[i++]);
			P = Integer.parseInt(input[i++]);
			int countP = 0;

			while (N > 0) {
				N--;
				int t = Integer.parseInt(input[i++]);
				int mod3 = t % 3;
				int bestResult = 0;
				

				// getting best result from triplet
				if (mod3 == 0) {
					bestResult = t / 3;					
				} else if (mod3 == 1)
					bestResult = ((t + 2) / 3);
				else if (mod3 == 2)
					bestResult = ((t + 1) / 3);
				else {
					throw new Exception("something's wrong with mod3");
				}

				// satisfies P?
				if (bestResult >= P) {
					countP++;
				} else {
					// surprising score allowed?
					if (S > 0 && t > 0 && mod3 != 1) {
						bestResult += 1;

						if (bestResult >= P) {
							countP++;
							S--;
						}

					}
				}

			}
			System.out.println(CASE_NO + (total - T) + SUFFIX + countP);
			// System.out.println(N + " " + S + " " + P);

		}

	}

	private static BufferedReader readFile(String fileName)
			throws FileNotFoundException {

		FileReader fr = new FileReader(fileName);
		BufferedReader br = new BufferedReader(fr);
		return br;
	}

}
