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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingGooglers
{
    public int googlers( int surprise, int mincount, int[] scores )
    {
        int counter = 0;
        for( int i = 0; i < scores.length; i++ )
        {
            int s = scores[i] % 3;
            int base = scores[i] / 3;
            if( s == 0 )
            {
                if( base >= mincount )
                {
                    counter++;
                }
                else
                {
                    if( surprise > 0 && base > 0 && base + 1 >= mincount )
                    {
                        counter++;
                        surprise--;
                    }
                }
            }
            else if( s == 1 )
            {
                if(base >= mincount || base +1 >= mincount)
                {
                    counter++;
                }
                else
                {
                    if(surprise > 0 && base +1 >= mincount)
                    {
                        counter++;
                        surprise--;
                    }
                }    
                
            }
            else if( s == 2 )
            {
                if(base >= mincount || base +1 >= mincount)
                {
                    counter++;
                }
                else
                {
                    if(surprise > 0 && base +2 >= mincount)
                    {
                        counter++;
                        surprise--;
                    }
                }    
                
            }
        }
        return counter;
    }

    public static void main( String[] args )
    {
        DancingGooglers dg = new DancingGooglers();

        try
        {
            FileWriter fw = new FileWriter( "output.out" );
            BufferedWriter out = new BufferedWriter( fw );

            FileReader fr = new FileReader( "in.in" );
            BufferedReader br = new BufferedReader( fr );
            String size = br.readLine();

            String temp = "";
            int k = 0;
            while( ( temp = br.readLine() ) != null )
            {                
                String[] split = temp.trim().split( " " );
                int googlercount = Integer.parseInt( split[0] );
                int surprise = Integer.parseInt( split[1] );
                int mincount = Integer.parseInt( split[2] );
                int[] scores = new int[googlercount];
                for(int i = 0;i<googlercount;i++)
                {
                    scores[i] = Integer.parseInt( split[i + 3] );
                }
                out.write( "Case #" + ( ++k ) + ": " + dg.googlers( surprise, mincount, scores ) + "\n" );
            }
            
            fr.close();
            out.close();
        }
        catch( FileNotFoundException e )
        {
            e.printStackTrace();
        }
        catch( IOException e )
        {
            e.printStackTrace();
        }
    }
}
