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

public class Dancing_With_the_Googlers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("input.in"));
		//BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		FileWriter fw = new FileWriter("output.txt");
		int t = Integer.parseInt(in.readLine());
		int num = 1;
		while (t-- > 0) {
			String[] a = in.readLine().split(" ");
			int n = Integer.parseInt(a[0]);
			int s = Integer.parseInt(a[1]);
			int p = Integer.parseInt(a[2]);
			Integer[] inp = new Integer[n];
			for (int i = 0; i < inp.length; i++) {
				inp[i] = Integer.parseInt(a[i + 3]);
			}
			Arrays.sort(inp);
			int c = 0;
			for (int i = 0; i < inp.length; i++) {
				int first = inp[i] / 3;
				int rem = inp[i] - first;
				int second = rem / 2;
				int third = rem - (rem / 2);

				if (first == second && second == third) {
					if (first >= p) {
						c++;
					} else if (s > 0 && first > 0 && first + 1 >= p) {
						c++;
						s--;
					}
				} else if (first == second && second == third - 1) {
					if (third >= p)
						c++;
				} else if (second == third) {
					if (third >= p) {
						c++;
					} else if (third > 0 && third + 1 >= p && s > 0) {
						c++;
						s--;
					}
				}
			}
			fw.write("Case #" + num++ + ": " + c + "\n");
		}
		fw.flush();
		fw.close();
	}
}
