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 b;
import java.io.*;

public class Main {


    public static void main(String[] args) {
        new Main().go();
    }


    public void go() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("B-small-attempt0.in"));
            out = new BufferedWriter(new FileWriter("B-small-attempt0.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int n = Integer.parseInt(line[0]);
                int s = Integer.parseInt(line[1]);
                int p = Integer.parseInt(line[2]);

                int []t = new int[n];
                for(int a=0;a<n;a++){
                    t[a] = Integer.parseInt(line[3+a]);
                }

                int win = 0;

                for(int b=0;b<n;b++){
                    int ok = t[b]/3;
                    int etr = t[b]%3;

                    switch(etr){
                        case 2:
                            if(ok+1>=p){
                                win++;
                            } else {
                                if(ok+2>=p && s>0){
                                    s--;
                                    win++;
                                }
                            }
                            break;

                        case 1:
                            if(ok+1>=p){
                                win++;
                            }
                            break;

                        case 0:
                            if(ok>=p){
                                win++;
                            } else {
                                if(ok>0 && s>0 && (ok+1)>=p){
                                    s--;
                                    win++;
                                }
                            }
                            break;
                    }

                }


                out.write("Case #"+(i+1)+": "+win+"\n");
                System.out.print("Case #"+(i+1)+": "+win+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("DONE\n");
    }
}
