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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.StringTokenizer;



public class Main {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		//BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream("c:\\input_B.txt")));
		int cases = Integer.parseInt(reader.readLine());
		for(int i=0; i<cases; i++){
			
			String inputString = reader.readLine();		
			StringTokenizer st = new StringTokenizer(inputString);			
			
			int numOfGooglers = Integer.parseInt(st.nextToken());
			int numOfSurprised = Integer.parseInt(st.nextToken());
			int threshold = Integer.parseInt(st.nextToken());
			
			ArrayList<Integer> total_points_list = new ArrayList<Integer>();
			for(int j=0; j<numOfGooglers; j++){
				total_points_list.add(Integer.parseInt(st.nextToken()));				
			}
			
			Collections.sort(total_points_list);
			Collections.reverse(total_points_list);
			//System.out.println(total_points_list);
			
			int numOfPassed = 0;
			
			outloop:
			for (Integer total_points : total_points_list) {
				int avg = total_points / 3;
				int remainder = total_points % 3;
				
				if(avg >= threshold) {
					++numOfPassed;
					continue;
				}
				
				switch(remainder) {
				case 0:
					if( (threshold - avg) == 1 && numOfSurprised > 0 && avg > 0) {						
						--numOfSurprised;	
						++numOfPassed;
					}
					break;
				case 1:
					if( (threshold - avg) == 1)
						++numOfPassed;
					break;
				case 2:
					if( (threshold - avg) == 1)
						++numOfPassed;
					
					if( (threshold - avg) == 2 && numOfSurprised > 0) {						
						--numOfSurprised;	
						++numOfPassed;
					}					
					break;
				}
			}
			
			System.out.println("Case #"+(i+1)+": "+numOfPassed);

			
		}

	}

}
