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.InputStreamReader;
import java.util.LinkedList;


public class Dancers {

	static LinkedList<Integer> scores;
	static int googlers = 0;
	static int surprising = 0;
	static int p;
	
	
	public static void main(String[] args) {
		String text = "";
		int tests = 0;
		int test_index=0;
		int result;
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			tests = Integer.parseInt(br.readLine());		
			while ((text = br.readLine()) != null && test_index < tests){							
				test_index++;
				String[] testcase = text.split(" ");
				googlers = Integer.parseInt(testcase[0]);
				surprising = Integer.parseInt(testcase[1]);
				p = Integer.parseInt(testcase[2]);
				int i = 3;
				scores = new LinkedList<Integer>();
				while(i<testcase.length){
					scores.add(Integer.parseInt(testcase[i]));
					i++;
				}
				result = calc();
				System.out.println("Case #" + test_index + ": " + result);
			}
		} catch (Exception e) {e.printStackTrace();}				
	}

	private static int calc() {
		int result = 0;
		for(int x : scores){
			
			if(p == 0) { result = scores.size(); break; }
			
			if(x == 0 && p == 0) { result++; continue; }
			if(x == 0 && p != 0) { continue; }
				
			int surpriseLimit = Math.max(p+(p-2)+(p-2),0);
			int okLimit = Math.max(p+(p-1)+(p-1),0);
			if(x >= okLimit) { result++; }			
			if(x >= surpriseLimit && x < okLimit && surprising > 0){
				surprising--;
				result++;
			}			
			
		}
		return result;
	}
	
}
