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.io.IOException;
import java.io.RandomAccessFile;
import java.util.Arrays;


public class Dancing {


	public static void main(String[] args) throws IOException {
		RandomAccessFile in = new RandomAccessFile(new File("B-small-attempt0.in"), "r");
		RandomAccessFile out = new RandomAccessFile(new File("DanceOut.out"),"rw");
		int num = Integer.parseInt(in.readLine());
		for (int j = 1; j <= num; j++){
			int count = 0;
			String[] numbers = in.readLine().split(" ");
			int gs = Integer.parseInt(numbers[0]);
			int special = Integer.parseInt(numbers[1]);
			int over = Integer.parseInt(numbers[2]);
			int[] arr = new int[gs];
			for (int i = 3; i < numbers.length; i++) {
				arr[i-3] = Integer.parseInt(numbers[i]);
			}
			Arrays.sort(arr);
			for (int i = 0; i < gs; i++) {
				int base = arr[i]/3;
				switch(arr[i] % 3) {
					case 0:
						if (special > 0 && base > 0 && (base+1) >= over) {
								count++;
								special--;
						}
						else if(base >= over) {
							count++;
						}
						
						break;
					case 1:
						if(base >= over || (base+1) >= over) {
							count++;
						}
						break;
						
					case 2:
						if (special > 0 && (base + 2) >= over) {
				        		count++;
				        		special--;
				        }
						else if ((base + 1) >= over || base >= over) count++;
				        
						break;
				}
			}
			out.writeBytes("Case #" + j + ": " + count + "\n");
		}
	}

}
