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

public class B {

	public static void main(String[] args) {
		try {
			BufferedReader input = new BufferedReader(new FileReader("/home/ramzy/Desktop/codejam/B-small.in"));
			PrintWriter output = new PrintWriter("/home/ramzy/Desktop/codejam/B-large.in");
			String line = input.readLine();
			int T = Integer.valueOf(line);
			for(int i = 1; i <= T; i++) {
				line = input.readLine();
				String[] values = line.split(" ");
				int N = Integer.valueOf(values[0]);
				int S = Integer.valueOf(values[1]);
				int p = Integer.valueOf(values[2]);
				int[] nums = new int[N];
				for(int j = 0; j < N; j++) {
					nums[j] = Integer.valueOf(values[3+j]); 
				}
				Arrays.sort(nums);
				int result = 0;
				for(int j = N-1; j >= 0; j--) {
					if(p == 0) {
						result++;
					} else if(p == 1) {
						if(nums[j] < 1)
							break;
						else
							result++;
					}else if(nums[j] > (p-1)*3) {
						result++;
					} else if(nums[j] > (p-2)*2 + (p-1) && S > 0) {
						result++;
						S--;
					} else if(S < 0) {
						break;
					}
				}
				
				output.println("Case #" + i + ": " + result);
				System.out.println("Case #" + i + ": " + result);
				
			}
			output.close();
			input.close();
		} catch(IOException e) {
			System.err.println(e);
		}
	}
	
}
