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

import java.io.*;
import java.util.*;

public class Dancing {

	/**
	 * @param args
	 */

	public static void main(String[] args) throws Exception{
		// TODO Auto-generated method stub

		Scanner input = new Scanner(new File("B-small-attempt0.in"));
		PrintWriter output = new PrintWriter(new FileWriter("output"));
			
		// Scanner in = new Scanner(System.in);
		int case_num = input.nextInt();
		//String word = in.nextLine();
		
		int[][] surprising = new int[31][11];
		int[][] normal = new int[31][11];
		//int i = 0;
		for(int score = 0; score <= 30; score++)
			for(int s = 0; s <= 10; s++){
				if(s == 0 && score == 0){
					surprising[score][s] = 0;
					normal[score][s] = 1;
					continue;
				}
				if(score == 0){
					surprising[score][s] = 0;
					normal[score][s] = 0;
					continue;
				}
				if(s == 0){
					surprising[score][s] = 0;
					normal[score][s] = 1;
					continue;
				}
				
				if(score < s){
					surprising[score][s] = 0;
					normal[score][s] = 0;
					continue;
				}
				
				if(score >= s * 3){
					surprising[score][s] = 1;
					normal[score][s] = 1;
					continue;
				}
				
				if(s == 1 && score == 1){
					surprising[score][s] = 0;
					normal[score][s] = 1;
					continue;
				}
				
				if(s == 1 && score == 2){
					surprising[score][s] = 1;
					normal[score][s] = 1;
					continue;
				}
				
				if(score >= s + (s - 2) * 2){
					surprising[score][s] = 1;
					if(score > s + (s - 2) * 2 + 1){
						normal[score][s] = 1;
					}else{
						normal[score][s] = 0;
					}
					continue;
				}else{
					surprising[score][s] = 0;
					normal[score][s] = 0;
					continue;
				}
				
			}
		for(int i = 0; i < case_num; i++){
			int n = input.nextInt();
			int s = input.nextInt();
			int p = input.nextInt();
			
			int[] t = new int[n];
			
			int total = 0;
			int only_surprising = 0;
			
			for(int j = 0; j < n; j++){
				t[j] = input.nextInt();
				
				if(surprising[t[j]][p] == 1 || normal[t[j]][p] == 1)
					total = total + 1;
				
				if(surprising[t[j]][p] == 1 && normal[t[j]][p] == 0)
					only_surprising = only_surprising + 1;
			}
			
			output.println("Case #" + (i + 1) + ": " + (total - Math.max(0, (only_surprising - s))));
			
			
		}
		input.close();
		output.flush();
		output.close();
	}

}
