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

import java.io.FileNotFoundException;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.regex.Pattern;

/**
 *
 * @author Tobi
 */
public class GoogleCodeJam {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int T = s.nextInt();
        for(int t = 1; t <= T; t++) {
            int N = s.nextInt(); //number of googlers
            int S = s.nextInt(); //number of surprising results
            int p = s.nextInt(); //number of target-best result
            int[] points = new int[N];
            for(int i = 0; i < N; i++)
                points[i] = s.nextInt();
            
            int matches = 0;
            for(int i = 0; i < N; i++) {
                if((points[i] / 3) + 2 < p) //skip results that are too low
                    continue;
                int a = points[i] / 3;
                int b = (points[i] - a) / 2;
                int c = (points[i] - a - b);
                int max = Math.max(Math.max(a, b), c);
                int delta = Math.max(Math.max(Math.abs(b - c), Math.abs(a - b)), Math.abs(a - c));
                
                if(max >= p) {
                    if(delta == 2 && S > 0) { //enough points, but surprising, surprises left?
                        S--;
                        matches++;
                        continue;
                    } else if (delta < 2) { //enough points, no surprise
                        matches++;
                        continue;
                    }
                }
                
                if((max + 1 >= p) && (delta < 2)) {
                    if((S > 0) && (delta == 0) && max > 0) { //can shift one point up and one down -> delta == 2 -> surprise left?
                        S--;
                        matches++;
                    } else if (S > 0 && delta == 1 && ((a == b && a == max) || (a == c && a == max) || (b == c && b == max))) { //can shift one point up, one down, but delta 
                        S--;
                        matches++;
                    }
                }
            }
            System.out.println("Case #" + t + ": " + matches);
        }
    }
}
