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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;


public class GCJ2012QA
{

    public static void main(String[] args) throws Exception
    {
        Scanner sc = new Scanner(new FileReader("A-input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter("A-output.txt"));
        
        final int CASE_COUNT = sc.nextInt();
        for(int caseNum = 1; caseNum<= CASE_COUNT; caseNum++){
            pw.print("Case #" + caseNum + ": ");
            //HERE WE SOLVE STUFF
            int ans = 0;
            
            int N = sc.nextInt();
            int S = sc.nextInt();
            int sp = sc.nextInt();
            for(int i =0; i<N; i++){
                int score = sc.nextInt();
                int kk = score % 3;
                int base = (score - kk)/3;
                
                if(base >= sp){
                    ans++;
                } else if( kk > 0 && (base + 1) >= sp && (base - 1) >= 0){
                    ans++;
                } else if(S>0) {
                    if(kk == 0 && (base+2) >= sp && (base - 1) >= 0){
                        ans++;
                        S--;
                    }
                    if(kk == 1 && (base+2) >= sp && (base - 1) >= 0){
                        ans++;
                        S--;
                    }
                    if(kk == 2 && (base+2) >= sp){
                        ans++;
                        S--;
                    }
                }
                 
            }
            
            //PUT ANSWER HERE
            pw.println(ans);
        }
        
        pw.flush();
        pw.close();
        sc.close();
    }

    
}
