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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package code3;

  import java.io.File;
 import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
   import java.lang.IllegalStateException;
import java.util.Arrays;
   import java.util.NoSuchElementException;
   import java.util.Scanner;

/**
 *
 * @author nhan
 */
public class Code3 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException {
        // TODO code application logic here
        Scanner input;
        input = new Scanner( new File( "B-small-attempt0.in" ) );
        FileOutputStream fos= new FileOutputStream("B-small-attempt0.out",false); 
        try (PrintWriter pw = new PrintWriter(fos)) {
            int t,n,s,p;
            
            t=input.nextInt();
            
            for (int i=1;i<=t;i++){
                System.out.print("Case #"+i+": ");
                pw.print("Case #"+i+": ");
                
                n=input.nextInt();
                s=input.nextInt();
                p=input.nextInt();
                
                int count = 0;
                int count0 = 0;
                for (int j=0;j<n;j++){
                    int x = input.nextInt();
                    int y = x/3;
                    int z = x%3;
                if ((p-y)<=0) count++;
                      switch(p-y){
                            
                                   
                            case 2:{
                                if (z==2){ count0++; count++;}
                                break;
                            }
                            case 1:{
                                if (x!=1 && x!=0) {
                                count++;
                                if (z==0)  count0++; break;
                                }
                            }
                        }
                        
                }//end for , end line s
               
                     if (s<=count0){
                        pw.print(count-count0+s);
                        
                     } else if (s>count0 && s<=n){
                        pw.print(count);
                       
                     } else {
                        pw.print("0");
                       
                     }
                
                
                
                pw.print("\n");
            }    
            
            pw.close();
        }
    }
}
