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.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintStream;
import java.util.regex.Pattern;

/**
 * @(#)DancingGoogler.java, 2012-4-14. 
 * 
 * Copyright 2012 Netease, Inc. All rights reserved.
 * NETEASE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
 */

/**
 *
 * @author bjdengdong
 *
 */
public class DancingGoogler {

    /**
     * @param args
     */
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("E:\\google_code_jam\\B-small-attempt0.in")));
        PrintStream out = new PrintStream(new FileOutputStream("E:\\google_code_jam\\B-small-attempt0.out"));
        
        int cases = Integer.parseInt(br.readLine());
        
        for (int i = 1; i <= cases; i++) {
            String line = br.readLine();
            String[] sp = line.split(Pattern.quote(" "));
            
            int n = Integer.parseInt(sp[0]);//num of googlers
            int s = Integer.parseInt(sp[1]);//num of surprises
            int p = Integer.parseInt(sp[2]);//best score p
            
            int[] scores = new int[n];
            int result = 0;
            int usedSurprise = s;
            for (int j = 0; j < n; j++) {
                scores[j] = Integer.parseInt(sp[j + 3]);
                if (canReachWithoutSuprise(scores[j], p)) {
                    result++;
                } else if (canReachWithSuprise(scores[j], p)) {
                    if (usedSurprise > 0) {
                        result++;
                        usedSurprise--;
                    }
                }
            }
            out.println("Case #" + i + ": " + result);
        }
        out.close();
    }

    private static boolean canReachWithSuprise(int score, int p) {
        if (score == 0 || score == 1)
            return false;
        return (score >= (3 * p - 4)) && (score <= (3 * p - 3));
    }

    private static boolean canReachWithoutSuprise(int score, int p) {
        if (p == 0)
            return true;
        return score >= (3 * p - 2);
    }

}
