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;
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package competition;

/**
 *
 * @author Sriram
 */

import java.util.Scanner;
import java.io.FileInputStream;
import java.io.PrintStream;

public class DancingWithGooglers_GCJ_2012 {
    
    public static void main(String args[]) throws Exception
    {
        Scanner in = new Scanner(new FileInputStream("f:\\input.in"));
        PrintStream out = new PrintStream("f:\\output.out");
        int T = in.nextInt();
        for(int i=0;i<T;i++)
        {
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int result = 0;
            int p1,p2,p3;
            int[] scores = new int[N];
            if(p>1)
            {
                p1 = (3*p)-4;
                p2 = p1+1;
            }
            else
            {
                p1 = p2 = p;
            }
            for(int j=0;j<N;j++)
            {
                scores[j] = in.nextInt();
            }
            for(int j=0;(j<N)&&(S>0);j++)
            {
                if(scores[j]==p1)
                {
                    result++;
                    S--;
                }
            }
            for(int j=0;(j<N)&&(S>0);j++)
            {
                if(scores[j]==p2)
                {
                    result++;
                    S--;
                }
            }
            for(int j=0;j<N;j++)
            {
                if(scores[j]>p2)
                {
                    result++;
                }
            }
            if(p == 0)
                result = scores.length;
            out.printf("Case #%d: %d\n",(i+1),result);
            
        }
    }
}
