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.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int ti = 0; ti < t; ti++) {
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int result = 0;
			List<Integer> list = new ArrayList<Integer>();
			for (int i = 0; i < n; i++)
				list.add(sc.nextInt());
			Collections.sort(list);

			int ns = n - s;

			for (int k = 0; k <= ns; k++) {
				int tr = 0;
				int j = 0;
				for (; j < k; j++) {
					int tmp;
					if (list.get(j) <= 1)
						tmp = list.get(j);
					else
						tmp = (list.get(j) - 1) / 3 + 1;
					if (tmp >= p)
						break;
				}
				tr += k - j;
				for (j = list.size() - (ns - k); j < list.size(); j++) {
					int tmp;
					if (list.get(j) <= 1)
						tmp = list.get(j);
					else
						tmp = (list.get(j) - 1) / 3 + 1;
					if (tmp >= p)
						break;
				}
				tr += list.size() - j;
				for (j = k; j < list.size() - (ns - k); j++) {
					int tmp;
					if (list.get(j) <= 1)
						tmp = -100;
					else
						tmp = (list.get(j) - 2) / 3 + 2;
					if (tmp >= p)
						break;
				}
				tr += list.size() - (ns - k) - j;
				result = Math.max(result, tr);
			}
			System.out.printf("Case #%d: %d%n", ti + 1, result);
		}
	}
}
