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 ab.gcj;

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Surprising {

    public static void main(String args[])
    {

        Surprising s = new Surprising();
    }

    public Surprising()
    {
        try{
            BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

            int numOfTests = Integer.parseInt(reader.readLine());
            for(int j = 0 ; j < numOfTests ; j++)
            {
            String[] tstr = reader.readLine().split(" ");
            int numGooglers = Integer.parseInt(tstr[0]);
            int surprising = Integer.parseInt(tstr[1]);
            int p = Integer.parseInt(tstr[2]);
            int [] t = new int[numGooglers];
            for(int i =0 ; i < t.length; i++)
            {
                t[i] = Integer.parseInt(tstr[i+3]);
            }

            System.out.println("Case #"+(j+1)+": "+test(numGooglers,surprising,p,t) );
            }
        }catch(Exception e)
        {

        }
    }

    public int test(int n , int s , int p, int[] t)
    {
        int count = 0 ;
        int surprising = s;

        for(int i = 0 ; i < t.length; i++)
        {
            if(t[i] == 0 )
            {
                if(p == 0) count++;
                continue;
            }
            int a = t[i]/3;
            int b  = a * 3;
            int rem = t[i] - b;
            if(a >= p) {

                count++;
            }
            else
            {
                if((surprising != 0) && rem == 0 && (a + 1 >= p)) {
                    surprising--;
                    count++;
                    continue;
                }
                if( rem == 1 && a+1 >=p)
                {
                    count++;
                }
                if(rem == 2)
                {
                    if(a + 1 >= p )
                    {
                        count++;
                        continue;
                    }
                    if(surprising != 0 && a+2 >=p)
                    {
                        surprising--;
                        count++;
                    }
                }
            }


        }

        return count;

    }
}
