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

package googlecodejam;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class GoogleCodeJam {
    
    public static int calcGooglers(int p, int s, int[] g) {
        int avg = p*3;
        int n = g.length;
        int cont = 0;
        for (int i = 0; i< n; i++) {
            if (g[i] >= avg ) {
                cont++;
            } else if (avg == 0){
                cont++;
            } else if (g[i] >= avg-2 && avg-2 >= p) {
                cont++;
            } else if (g[i] >= avg-4 && avg-4 >= p) {
                if (s > 0) {
                    cont++;
                    s--;
                }
            }
        }
        return cont;
    }
    
    public static void doIt() throws Exception {
        Scanner sc = new Scanner(new FileReader("/home/fuelusumar/input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("/home/fuelusumar/output.txt"));
        int caseCnt = sc.nextInt();
        for (int caseNum = 0; caseNum < caseCnt; caseNum++) {
            pw.print("Case #" + (caseNum + 1) + ": ");
            /***********************************************/
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] g = new int[n];
            for (int googler = 0; googler < n; googler++) {
                g[googler] = sc.nextInt();
            }
            /***********************************************/
            pw.println(calcGooglers(p,s,g));
        }
        pw.flush();
        pw.close();
        sc.close();
    }
    
    
    public static void main(String[] args) throws Exception {
        doIt();
    }
}
