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.*;
import java.util.*;
public class BSmall {
	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new File("B-small-attempt1.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-Small.out")));
		
		int T = Integer.parseInt(in.nextLine());
		
		for (int i = 0; i < T; i++) {
			String[] Line = in.nextLine().split(" ");
			int counter = 0;
			int surprising = Integer.parseInt(Line[1]);
			int thresh = Integer.parseInt(Line[2]);
			
			int len = Line.length;
			
			for (int j = 3; j < len; j++) {
				int score = Integer.parseInt(Line[j]);
				
				if (score == 0) {
					if (score >= thresh) {
						counter++;
					}
					Line[j] = null;
					continue;
				}
				
				int mod3 = score % 3;
				switch (mod3) {
					case 2: if ((score/3) + 1>= thresh) {
						counter++;
						Line[j] = null;
						break;
					}
					case 1: if ((score/3) + 1 >= thresh) {
						counter++;
						Line[j] = null;
						break;
					}
					case 0: if ((score/3) >= thresh) {
						counter++;
						Line[j] = null;
						break;
					}
				}
			}
				for (int l = 3; l < len && surprising > 0; l++) {
					if (!(Line[l] == null)) {
						int score = Integer.parseInt(Line[l]);
						int mod3 = score % 3;
						switch (mod3) {
							case 2: if ((score/3) + 2 >= thresh) {
								counter++;
								surprising--;
								break;
								
							}
							case 1: if ((score/3) + 1 >= thresh) {
								counter++;
								surprising--;
								break;
							}	
							case 0: if ((score/3) + 1 >= thresh) {
								counter++;
								surprising--;
								break;
							}
						}
					}	
				}
				
			out.write("Case #"+ (i+1) +": " + counter);
			if (i != T-1)
				out.write("\n");
			//System.out.println(counter);
			//System.out.println(Arrays.toString(Line));
		}
		
		out.close();
		System.exit(0);
	}
}
