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

public class core {
	public static void main(String[] argv) throws Exception {
	
		String inputFile = argv[0];
		Scanner scan = null;
		FileReader fR = null;
		BufferedReader bR = null;

		int T;
		
		
		try{
			
			fR = new FileReader(inputFile);
			bR = new BufferedReader(fR);

			
			
			T = Integer.parseInt(bR.readLine());
			
			for(int i = 0; i <= T; i++){
				
				String[] temp = (bR.readLine()).split(" ");
				int[] input = new int[temp.length];
				for(int j =0; j < temp.length; j++){
					input[j] = Integer.parseInt(temp[j]);
				
				}
				
				int N = input[0];
				int S = input[1];
				int p = input[2];
				int[] division = new int[N];
				int[] remainder = new int[N];
				int out=0;
				
				
				for(int k = 3; k < input.length; k++){
					
					division[k-3] = input[k]/3;
					remainder[k-3] = input[k]-(division[k-3]*3);
					//System.out.println("" + division[k-3] + " : " + remainder[k-3] );
				}
				
				//System.out.println();
				
				for(int l = 0; l < division.length; l++){
					if(division[l]>=p){
						out++;
						//System.out.println("Did " + l);
					} else if ((division[l] == (p-1)) && (remainder[l]>0) ){
						out++;
						//System.out.println("Did 1 " + l);
					} else if ((division[l] == (p-2)) && (remainder[l]==2) && S > 0){
						out++;
						S--;
						//System.out.println("Did 2 " + l);
					} else if (division[l] == p-1 && remainder[l] == 0 && S > 0 && division[l] > 0){
						out++;
						S--;
						//System.out.println("Did 3 " + l);
					} 
						
				}
				
				int caseIndex = i+1;
				System.out.println("Case #" + caseIndex + ": " + out);
			
			}
			
		} catch(Exception e){}
	}
}
