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

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class Googlers {
    public static void main(String[] args) throws IOException {
        final Scanner reader = new Scanner(new File("in.txt"));
        final FileWriter writer = new FileWriter(new File("out.txt"));
        
        final int N = reader.nextInt();
        reader.nextLine();
        
        for (int i = 0; i < N; i++) {
            final int n = reader.nextInt();
            final int exceptions = reader.nextInt();
            final int winScore = reader.nextInt();
            
            final int [] participants = new int [n]; 
            for (int j = 0; j < n; j++) {
                participants[j] = reader.nextInt();
            }
            
            writer.write(String.format("Case #%d: %d", (i + 1), howManyCanWin(exceptions, winScore, participants)));
            if (i < N - 1) {
                writer.write("\n");
            }
        }
        
        writer.close();
    }
    
    public static int howManyCanWin(final int exceptions, final int winScore, final int [] participants) {
        int remainException = exceptions;
        int res = 0;
        
        for (int i : participants) {
            final int thirdPart = i / 3;
            final int lastPart = i % 3;

            if ((thirdPart >= winScore) ||
                (lastPart == 1 && thirdPart + 1 >= winScore) ||
                (lastPart == 2 && thirdPart + 1 >= winScore)) {
                res++;
                continue;
            }
            
            if ((lastPart == 0 && thirdPart + 1 >= winScore && thirdPart - 1 >= 0 && remainException > 0) || 
                (lastPart == 2 && thirdPart + 2 >= winScore && remainException > 0)    ){
                remainException --;
                res++;
                continue;
            }
        }
        
        return res;
    }
}
