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


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author ZuoZhong
 */
public class Dancer {

    public static void main(String[] args) throws IOException {
        File file = new File("B-small-attempt2.in");
        BufferedReader in = new BufferedReader(new FileReader(file));
        String line = in.readLine();
        BufferedWriter out = new BufferedWriter(new FileWriter("Dancer_output.txt"));

        int T = Integer.parseInt(line);
        for (int x = 1; x <= T; x++) {
            line = in.readLine();
            String[] input = line.split(" ");
            int N = Integer.parseInt(input[0]); // number of googlers
            int S = Integer.parseInt(input[1]); // number of surprising score
            int p = Integer.parseInt(input[2]); // at least 1 score > p 
            int ans = 0;
            int lowerBound = 0;
            if (p == 0) {
                lowerBound = 0;
            } else if (p == 1) {
                lowerBound = 1;
            } else {
                lowerBound = 3 * p - 4;
            }

            for (int y = 3; y < N + 3; y++) {
                int score = Integer.parseInt(input[y]);
                if (score >= lowerBound) {
                    //fliter out lower bound surprising
                    if(score == (3*p-3) || score == (3*p-4)){
                        //within the suprising bound
                        if(S > 0){
                            S--;
                            ans++;
                        }
                    }else{
                        ans++;
                    }
                }
            }

            out.write("Case #" + x + ": " + ans);
            out.newLine();
            System.out.println("Case #" + x + ": " + ans);
        }
        in.close();
        out.close();
    }
}
