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.IOException;
import java.io.InputStreamReader;

/**
 * Google code jam.
 * Qualification Round 2012.
 * Problem B. Dancing With the Googlers
 * 
 * Usage: &lt;app&gt; &lt;input &gt;output
 * 
 * @author sombrabr@gmail.com
 *
 */
public class QualB {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int cases = new Integer(in.readLine());
		
		run(in, cases);
	}
	
	static void run(BufferedReader in, int cases) throws IOException {
		for(int i=0; i<cases; ++i) {
			String line = in.readLine();

			System.out.print("Case #" + (i+1) + ": ");
			
			String[] parts = line.split(" ");
			
			int j=0;
			int N = Integer.parseInt(parts[j++]); // Number of Googlers
			int S = Integer.parseInt(parts[j++]); // Surprising triplets
			int p = Integer.parseInt(parts[j++]); // Best result base
			
			int tripletScore = p+2*(Math.max(0, p-2)); // Triplet score
			int minimumScore = p+2*(Math.max(0, p-1)); // Minimum score not a triplet
			
			int surprisings = 0; // Total surprisings already found
			
			int googlers = 0; // Count of Googlers with p
			
			for(int k=0; k<N; ++k) {
				int t = Integer.parseInt(parts[j++]); // Total score
				
				if(t>=minimumScore) {
					googlers++;
				} else if(t>=tripletScore && surprisings<S) {
					surprisings++;
					googlers++;
				}
			}
			
			System.out.println(googlers);
		}
	}
}
