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.util.*; 
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
//SRM525
public class ggcjb {
	static int counter = 0;
	static int dp[][] = new int[3][3];
	
	public static int store(int t, int p){
		int divided = t/3;
		
		int a = divided,b = divided,c = divided;
		int remain = t % 3;
		if(remain == 2){
			a++;
			b++;
		}
		if(remain == 1){
			a++;
		}
		dp[counter][0] = a;
		dp[counter][1] = b;
		dp[counter][2] = c;
		//System.out.println(a);
		//System.out.println(b);
		//System.out.println(c);
		//System.out.println(p);
		counter++;
		if(a >= p || b >= p || c >= p){
			return 1;
		}
		return 0;
	}
	
	public static int check(int N, int s, int p){
		int supply = 0;
		for(int i = 0; i < N; i++){
			if(dp[i][0] < p && s > 0){
				dp[i][0]++;
				dp[i][1]--;
				if(dp[i][0] < p ||dp[i][0] - dp[i][1] > 2 || dp[i][1] < 0){
					continue;
				}
				else{
					supply++;
					s--;
				}
			}
		}
		//System.out.println(supply);
		return supply;
	}
	
	public static void main(String[] args) throws FileNotFoundException { 
		int answer = 0;
		Scanner scan = new Scanner(System.in);
		int max = scan.nextInt();

		
		//int dp[][] = new int[3][3];
		
		for(int i = 1; i <= max; i++){
			int N = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			for(int j = 1; j <= N; j++){
				int n = scan.nextInt();
				answer = answer + store(n, p);
			}
			int supply = check(N, s, p);
			//System.out.println(supply);
			answer = answer + supply;
			System.out.println("Case #" + i + ": " + answer);
			counter = 0;
			answer = 0;
		}
	} 
	
}
