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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Dance {
    public static void main(String[] args) throws Exception {
       BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
       BufferedWriter bw = new BufferedWriter(new FileWriter("out.txt"));
       
       int T = Integer.parseInt(br.readLine().trim());
       
       for(int t = 1; t<=T; t++){
           String[] s = br.readLine().trim().split(" ");
           int N = Integer.parseInt(s[0]);
           int S = Integer.parseInt(s[1]);
           int P = Integer.parseInt(s[2]);
           int[] ps = new int[N];
           for(int i = 3; i < s.length; i++){
               ps[i-3] = Integer.parseInt(s[i]);
           }
           List<Integer[]> l = new ArrayList<Integer[]>();
           int res = 0;
           for(int p : ps){
               if(p == 0){
                   l.add(new Integer[]{0, 0, 0});
                   continue;
               }
               if(p%3 == 0){
                   if(p/3 >= P || p/3<=(P-2) || S<=0){
                        l.add(new Integer[]{p/3, p/3, p/3});
                   }else{
                       l.add(new Integer[]{p/3, p/3-1, p/3+1});
                       S--;
                   }
               }else if(p%3 == 1){
                   l.add(new Integer[]{p/3, p/3, p/3+1});
               }else{
                   if(p/3 == 9){
                       l.add(new Integer[]{p/3+1, p/3+1, p/3});
                   }else{
                       if(p/3 >= P || p/3<(P-2)){
                           l.add(new Integer[]{p/3+1, p/3+1, p/3});
                       }else{
                           if (S<=0){
                              l.add(new Integer[]{p/3+1, p/3+1, p/3});
                           }else{
                              l.add(new Integer[]{p/3, p/3, p/3+2});
                              S--;
                           }
                       }
                   }
               }
           }
//           
//           for(Integer[] arr: l) System.out.println(Arrays.toString(arr));
//           System.out.println("");
           
           for(Integer[] arr: l){
               if(arr[0]>=P || arr[1]>=P || arr[2]>=P){
                   res++;
               }
           }
           bw.write("Case #"+t+": "+res);
           bw.newLine();
       }
       
       br.close();
       bw.close();
    }
}
