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


public class Dance {

	static int getMaxGooglers(int N,int S, int p, int[] t) {
		int count=0;
		int surpriseCount=0;
		
		int avg=p*3;
		for(int i=0;i<N;i++) {
			
			/*if(t[i]>=avg)
				count++;
			
			else */
			if(t[i]>=p) {
				if(t[i]>=avg-2)
			
				count++;
			
			else if(surpriseCount<S)
			{
				if(t[i]>=avg-4) {
					count++;
					surpriseCount++;
				}
			}
			}
		}
		return count;
	}
	public static void main(String args[]) {
		try {
			BufferedReader br=new BufferedReader(new InputStreamReader(new FileInputStream("c:\\gcj\\B\\B-small-attempt1.in")));
			String line=br.readLine();
			PrintStream ps=new PrintStream("c:\\gcj\\B\\B-small1.out");
			
			int n=Integer.parseInt(line);
				for(int i=1;i<=n;i++) {
					
					line=br.readLine();				
					String[] nums=line.split(" ");
					int N=Integer.parseInt(nums[0]);
					int S=Integer.parseInt(nums[1]);
					int P=Integer.parseInt(nums[2]);
					int t[]=new int[N];
					for(int j=0;j<N;j++)
					{
						t[j]=Integer.parseInt(nums[j+3]);
					}
					ps.println("Case #"+i+": "+getMaxGooglers(N, S, P, t));
											
				}
			} 
			catch(Exception e) {
				e.printStackTrace();
			}
			
			
		}
		

	public static void ain(String[] args) {
		// TODO Auto-generated method stub
		
		int N=2;
		int S=1;
		int p=1;
		int[] t={8,0};
		System.out.println(" count : " + getMaxGooglers(N, S, p, t));
	}

}
