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.*;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

public class Main2 {

    public static void main(String[] args) {
        try {
            Scanner in = new Scanner(new BufferedReader(new FileReader("in.txt")));
            BufferedWriter out = new BufferedWriter(new FileWriter("out.txt"));
            int t;
            t = in.nextInt();
            in.nextLine();
            for (int i = 1; i <= t; i++) {
                int n, s, p;
                n = in.nextInt();
                int g[] = new int[n];
                s = in.nextInt();
                p = in.nextInt();
                for (int j = 0; j < n; j++) {
                    g[j] = in.nextInt();
                }
                in.nextLine();
                int count = 0;
                for (int k = 0; k < g.length; k++) {
                    if (g[k] != 0 || p == 0) {
                        int div = g[k] / 3;
                        int mod = g[k] % 3;
                        if (mod == 0) {
                            if (div >= p) {
                                count++;
                            } else if (div + 1 >= p && s > 0) {
                                count++;
                                s--;
                            }
                        } else if (mod == 1) {
                            if (div + 1 >= p) {
                                count++;
                            }
                        } else {
                            if (div + 1 >= p) {
                                count++;
                            } else if (div + 2 >= p && s > 0) {
                                count++;
                                s--;
                            }
                        }
                    }
                }

                String toPrint = "Case #" + i + ": " + count;
                if (i != t) {
                    toPrint += "\n";
                }
                out.write(toPrint);
            }
            in.close();
            out.close();
        } catch (Exception ex) {
            Logger.getLogger(Main2.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
}
