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.
 */


import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;

/**
 *
 * @author violetlily
 */
public class Jam2012Q_B_S {

    private final String ipath = "B-small-attempt1.in";
    private final String opath = "B-small-attempt1.ou";

    public void Handle() throws FileNotFoundException {
        
        PrintStream out = new PrintStream(   
                new BufferedOutputStream(   
                        new FileOutputStream(opath)));   
        System.setOut(out);
        
        Scanner sc = new Scanner(new FileInputStream(new File(ipath)));
        int m = sc.nextInt();
        int ii = 1;
        while (m > 0) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int c = 0;
            while(n > 0){
                int t = sc.nextInt();
                if(t%3 == 0){
                    if(t/3 >= p && t/3!= 0){
                        c ++;
                    }else if(t/3 +1 >= p && s > 0 && t/3!= 0){
                        c ++;
                        s--;
                    }else if(t == 0 && t/3 >= p){
                        c ++;
                    }
                }
                else if(t%3 == 1){
                    if(t/3 + 1 >=p ){
                        c++;
                    }
                }else{
                    if(t/3 +1 >= p){
                        c++;
                    }else if(t/3 + 2 >=p && s > 0){
                        c++;
                        s--;
                    }
                }
               n--;
            }
  
            System.out.println("Case #" + ii + ": " + c );
            ii++;
            m--;
        }
        out.close();
    }
    

    public static void main(String args[]) throws Exception {
        Jam2012Q_B_S t = new Jam2012Q_B_S();
        t.Handle();
    }
}
