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.File;
import java.io.PrintWriter;
import java.util.*;
import java.util.jar.JarEntry;

/**
 * Created with IntelliJ IDEA.
 * User: vitaly
 * Date: 4/14/12
 * Time: 9:24 AM
 * To change this template use File | Settings | File Templates.
 */
public class Main {

    public static Map<Integer, Integer> createMap(int dif) {
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for(int i = 0; i <= 10; i++) {
            for(int j = 0; j <= 10; j++) {
                for(int k = 0; k <= 10; k++) {
                    int min = Math.min(i, Math.min(j, k));
                    int max = Math.max(i, Math.max(j, k));
                    int sum = i + j + k;
                    if((max - min) <= dif) {
                        Integer val = map.get(sum);
                        if(val == null || val < max) {
                            map.put(sum, max);
                        }
                    }
                }
            }
        }
        return map;
    }

    public static void main(String[] args) throws Exception {

        Map<Integer, Integer> map1 = createMap(1);
        Map<Integer, Integer> map2 = createMap(2);


        Scanner scanner = new Scanner(new File("B-small-attempt0.in"));
        PrintWriter pw = new PrintWriter(new File("google.out"));

        int n = scanner.nextInt();
        for(int i = 0; i < n; i++) {
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int p = scanner.nextInt();
            int count = 0;
            for(int k = 0; k < N; k++) {
                int sum = scanner.nextInt();
                if(map1.get(sum) >= p) {
                    count++;
                } else if(map2.get(sum) >= p && S > 0) {
                    count++;
                    S--;
                }
            }
            pw.print(String.format("Case #%d: %d%n", i + 1, count));
        }


        scanner.close();
        pw.close();


    }

}
