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

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

/**
 *
 * @author Luis Sergio Curay
 */
public class b_2 {

    public b_2() {
        Scanner in= new Scanner(System.in);
        int t= in.nextInt();
        HashMap<Integer, ArrayList<ArrayList<Integer>>> comb= new HashMap<Integer, ArrayList<ArrayList<Integer>>>();
        for (int i = 0; i <= 30; i++) {
            ArrayList<ArrayList<Integer>> curr= new ArrayList<ArrayList<Integer>>();
            for (int j = 0; j <= 10; j++) 
                for (int k = 0; k <= 10; k++) 
                    for (int l = 0; l <= 10; l++) 
                        if((j+k+l) == i) {
                            ArrayList<Integer> tmp= new ArrayList<Integer>();
                            int arr[]= new int[]{j,k,l};
                            Arrays.sort(arr);
                            for (int m = 0; m < arr.length; m++) {
                                tmp.add(arr[m]);
                            }
                            curr.add(tmp);
                        }
            comb.put(i, curr);
        }
        for (int i = 0; i < t; i++) {
            int n= in.nextInt();
            int s= in.nextInt();
            int p= in.nextInt();
            int res= 0;
            for (int j = 0; j < n; j++) {
                int c= in.nextInt();
                int rank= 0;
                ArrayList<ArrayList<Integer>> curr= comb.get(c);
                for (ArrayList<Integer> combs : curr) {
                    if(combs.get(0).equals(combs.get(1)) && combs.get(0).equals(combs.get(2))) {
                        if(combs.get(0) >= p) {
                            rank=6;break;//res++;break;
                        }
                    } else if(combs.get(0).equals(combs.get(1))) {
                        if(combs.get(2) >= p && (combs.get(2) - combs.get(1)) == 1) {
                            if(rank < 5) rank= 5;//res++;break;
                        } else if(combs.get(2) >= p && (combs.get(2) - combs.get(1)) == 2 && s > 0) {
                            if(rank < 4) rank= 4;//res++;s--;break;
                        }
                    } else if(combs.get(1).equals(combs.get(2))) {
                        if(combs.get(1) >= p && (combs.get(1) - combs.get(0)) == 1) {
                            if(rank < 3) rank= 3;//res++;break;
                        } else if(combs.get(1) >= p && (combs.get(1) - combs.get(0)) == 2 && s > 0) {
                            if(rank < 2) rank= 2;//res++;s--;break;
                        }
                    } else {
                        if(combs.get(2) >= p)
                            if((combs.get(2) - combs.get(1)) == 1 && (combs.get(1) - combs.get(0)) == 1 && s > 0) {
                                if(rank < 1) rank= 1;//res++;s--;break;
                            }
                    }
                }
                if(rank == 6 || rank ==5 || rank == 3)
                    res++;
                else if( rank > 0){
                    res++;s--;
                }
            }
            System.out.println("Case #" + (i + 1) + ": " + res);
        }
    }
    
    public void print(ArrayList<Integer> t) {
        for (Integer integer : t) {
            System.out.print(integer + " ");
        }
        System.out.println();
    }
}