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

import java.io.File;
import java.io.IOException;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Path;
import java.util.ArrayList;
import java.util.List;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author Arber
 */
public class Google {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Path input_path = new File("Input.in").toPath();
        try {
            List<String> input_list = Files.readAllLines(input_path,Charset.forName("UTF-8"));
            int begin = 0;
            while(begin<input_list.size())
            {
                int start = new Integer(input_list.get(begin)).intValue();
                for(int i = 0; i<start; i++)
                {
                    String[] in = input_list.get(begin+i+1).split(" ");
                    int[] t = new int[in.length-3];
                    for(int j=3; j<in.length;j++)
                    {
                        t[j-3] = new Integer(in[j]).intValue();
                    }
                    System.out.println("Case #"+(i+1)+": " +google4(new Integer(in[0]).intValue(), new Integer(in[1]).intValue(), new Integer(in[2]).intValue(), t));
                }
                begin = begin + start + 1;
            }
        } catch (IOException ex) {
            Logger.getLogger(Google.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
    
    public static int google3(int n, int m)
    {
        ArrayList<String> a1 = new ArrayList<String>();
        for(int i = n; i<=m; i++)
        {
            for(int j = 1; j<(""+n).length();j++)
            {
                int rec = recycled(""+i, j);
                if(rec>=n &&rec<=m && rec != i)
                {
                    if(rec<i)
                    {
                        String tem = (""+rec)+(""+i);
                        if(!a1.contains(tem))
                            a1.add(tem);
                    }
                    else
                    {
                        String tem = (""+i)+(""+rec);
                        if(!a1.contains(tem))
                            a1.add(tem);
                    }
                }
            }
        }
        return a1.size();
            
    }
    public static int recycled(String s, int m)
    {
        s = s.substring(s.length()-m) + s.substring(0,s.length()-m);
        return new Integer(s).intValue();
    }
    public static int google4(int T,int s,int p, int[] t)
    {
        int rez = 0;
        for(int i=0; i<T; i++)
        {
            if(t[i]>=3*p-2)
                rez++;
            else if((t[i]>=3*p-4&&s>0&&p>1))
            {
                s--;
                rez++;
            }
        }
        return rez;
    }
}
