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

public class B {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		int n; // # googlers
		int s; // surprising
		int p; // score
		int scores[];
		int max;
		int min;
		int ret;

		BufferedReader br = new BufferedReader(new FileReader("b.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("b.out"));
		StringTokenizer tk;

		int tests = Integer.parseInt(br.readLine().trim());

		for (int t = 1; t <= tests; t++) {
			tk = new StringTokenizer(br.readLine());
			n = Integer.parseInt(tk.nextToken());
			s = Integer.parseInt(tk.nextToken());
			p = Integer.parseInt(tk.nextToken());

			max = 3 * p - 2;
			min = 3 * p - 4;

			ret = 0;
			scores = new int[n];
			for (int j = 0; j < scores.length; j++)
				scores[j] = Integer.parseInt(tk.nextToken());

			Arrays.sort(scores);

			if (p >= 2)
				for (int i = scores.length - 1; i >= 0; i--) {
					if (scores[i] >= max)
						ret++;
					else if (scores[i] < min)
						break;
					else {
						
						if (s==0)break;
						ret++;
						s--;
					}
				}

			else {
				if (p == 0)
					ret += scores.length;
				else
					for (int i = scores.length-1; i>=0; i--) {
						if (scores[i] > 0)
							ret++;
						else
							break;
					}

			}

//			System.out.println("Case #" + t + ": " + ret);
			bw.write("Case #" + t + ": " + ret);
			bw.newLine();

		}

		bw.close();
	}

}
