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.*;
import java.util.*;

/**
 *
 * @author kronenthaler
 */
public class B {
	static HashMap<Integer, Set<ArrayList<Integer>>> cache = new HashMap<Integer, Set<ArrayList<Integer>>>();
	public static void main(String arg[]){
		try{
			int max = 0;
			for(int i=0;i<=10;i++){
				for(int j=0;j<=10;j++){
					for(int k=0;k<=10;k++){
						if(Math.abs(i-j)<=2 && Math.abs(j-k)<=2 && Math.abs(i-k)<=2){
							if(cache.get(i+j+k)==null)
								cache.put(i+j+k, new HashSet<ArrayList<Integer>>());
							ArrayList<Integer> a = new ArrayList<Integer>();
							a.add(i);
							a.add(j);
							a.add(k);
							Collections.sort(a);
							cache.get(i+j+k).add(a);
							max = Math.max(max, cache.get(i+j+k).size());
						}
					}
				}
			}

			Scanner in = new Scanner(new FileInputStream("b-small.in"));
			//Scanner in = new Scanner(new FileInputStream("b-large.in"));
			System.setOut(new PrintStream("b.out"));
			int T = in.nextInt();
			for(int cases=1;cases<=T;cases++){
				int n = in.nextInt();
				int s = in.nextInt();
				int p = in.nextInt();
				int g[] = new int[n];
				
				for(int i=0;i<n;i++){
					g[i] = in.nextInt();
				}

				System.out.printf("Case #%d: %d\n",cases, bt(g,s,p,0,0));
			}
		}catch(Exception e){
			e.printStackTrace();
		}
	}

	static int bt(int[]g, int s, int p, int acum, int current){
		if(current == g.length) return s==0?acum:-1;
		int max = -1;
		Set<ArrayList<Integer>> a = cache.get(g[current]);
		for(ArrayList<Integer> arr : a){
			if(Math.abs(arr.get(0)-arr.get(2))==2){
				if(s!=0)
					max = Math.max(max, bt(g, s-1, p, acum + (arr.get(2)>=p?1:0), current+1));
			}else{
				max = Math.max(max, bt(g, s, p, acum + (arr.get(2)>=p?1:0), current+1));
			}
		}
		return max;
	}
}
