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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;
/**
 * @author alei
 */
public class B {
    public static void main(String[]Args) throws FileNotFoundException{
        Scanner sn = new Scanner(new FileInputStream("B.in"));
        System.setOut(new PrintStream("B.out"));
        int nCases = sn.nextInt();        
        for(int i=0;i<nCases;i++){
            sn.nextLine();
            int N = sn.nextInt();
            int S = sn.nextInt();
            int P = sn.nextInt();
            int[]totalPoints = new int[N];
            for(int j=0;j<N;j++){
                totalPoints[j] = sn.nextInt();                
            }
            int result = solve(totalPoints,S,P);
            System.out.println("Case #"+(i+1)+": "+result);
        }
                
    }
    public static int solve(int[]totalPoints,int S,int P){
        int m = 0;
        int min = 3*P-4;
        min = min<0?P:min+0;        //the right
        //min = min<0?0:min+0;
        int max = 3*P+4;
        //System.out.println("["+min+";"+max+"]");
                
        int c=0,a=0,ssp=0,sns=0;
        int gigants = 0;
        
        int s1 = 3*P-4;
        int s2 = 3*P-3;
        int s3 = 3*P+3;
        int s4 = 3*P+4;
        for(int i=0;i<totalPoints.length;i++){
            int point = totalPoints[i];
            if(point<=max && point>=min){
                m++;
                if(point==s1 || point==s2||point==s3||point==s4){
                    int n1 = (point+2)/3;
                    if(n1>=P){
                        //System.out.println("sns++->"+point);
                        sns++;
                    }
                    c++;
                }
                else{
                    int n1 = (point+2)/3;
                    if(n1>=P){
                        ssp++;
                    }
                }
            }
            else if(point >max){
                gigants++;
                m++;
            }
            else{
                a++;
            }
        }
        //System.out.println("m->"+m+"->gig->"+gigants+"->a->"+a+"->S->"+S+"->c->"+c+"<->nsp->"+ssp);
                
        if(S>c){
            S-=c;
            if(S>0){
                S-=gigants;
                if(S>0){
                   S-=a;
                   if(S>0){
//                       System.out.println("finalSubst->"+m+"-s:"+S);
                       int reaNsp = Math.min(S, ssp);
                       m = m-S+reaNsp;
                   }
                }
            }            
        }
        else{            
            //sns = Math.min(S, sns);
            int fns = c-S;
            //System.out.println("fns->"+fns+"<->sns->"+sns);
            if(sns>=fns){
                
            }
            else{
                m = m - fns + sns;
            }
        }
        
        return m;
    }
}
