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

/**
 * @(#)Main.java
 *
 *
 * @author 
 * @version 1.00 2012/4/14
 */
 import java.io.*;

public class Main {
	
    public static void main(String[] args)throws IOException {
        BufferedReader br = new BufferedReader(new FileReader("B-small-attempt4.in"));
        FileWriter fstream = new FileWriter("B-small-attempt4.out");
        BufferedWriter out = new BufferedWriter(fstream);
        String in = br.readLine();
        int testCases = Integer.parseInt(in);
        int i = 1;
        
        while(testCases > 0) {
        	in = br.readLine();
        	out.write("Case #" + i + ": " + solve(in.split(" ")) + "\n");
        	testCases--;
        	i++;
        }
        out.close();
    }
    
    public static int solve(String[] in) {
    	int n = Integer.parseInt(in[0]);
    	int s = Integer.parseInt(in[1]);
    	int p = Integer.parseInt(in[2]);
    	int solution = 0;
    	
    	for(int i = 3; i < in.length; i++) {
    		int t = Integer.parseInt(in[i]);
    		switch(p) {
    			case 0:solution++;break;
    			case 1:if(t >= 1) solution++;break;
    			case 2:if(s > 0 && (t >= 2 && t <= 3)){solution++; s--;}else if(t > 3)solution++;break;
    			case 3:if(s > 0 && (t >= 5 && t <= 6)){solution++; s--;}else if(t > 6)solution++;break;
    			case 4:if(s > 0 && (t >= 8 && t <= 9)){solution++; s--;}else if(t > 9)solution++;break;
    			case 5:if(s > 0 && (t >= 11 && t <= 12)){solution++; s--;}else if(t > 12)solution++;break;
    			case 6:if(s > 0 && (t >= 14 && t <= 15)){solution++; s--;}else if(t > 15)solution++;break;
    			case 7:if(s > 0 && (t >= 17 && t <= 18)){solution++; s--;}else if(t > 18)solution++;break;
    			case 8:if(s > 0 && (t >= 20 && t <= 21)){solution++; s--;}else if(t > 21)solution++;break;
    			case 9:if(s > 0 && (t >= 23 && t <= 24)){solution++; s--;}else if(t > 24)solution++;break;
    			case 10:if(s > 0 && (t >= 26 && t <= 27)){solution++; s--;}else if(t > 27)solution++;break;
    		}
    	}
    	return solution;
    }
}
