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 Googlers {

	public static int surprise = 0;
	public static int beatTarget = 0;
	
	public static boolean bestScore(int totalScore, int targetScore) {
		
		int bestNoSurprise = (int) Math.ceil(totalScore/3.0);
		
		// If this googler beat the target score
		if(bestNoSurprise>=targetScore) {
			beatTarget += 1;
			return true;
		}
		
		// These are scores that can be a surprise, if there is surprise left
		else if(totalScore%3!=1&&totalScore>1&&totalScore<29&&surprise>0) {
			
			// Test if surprising the score would help
			if(bestNoSurprise<targetScore&&(bestNoSurprise+1)>=targetScore) {
				
				surprise-=1;
				beatTarget += 1;
				return true;
				
			}
	
		}
		
		// These are scores that had no hope
		return true;
		
		
	}
	
	public static void main(String[] args) {
		
		Scanner input = null;
		PrintWriter output = null;

		try {
			output = new PrintWriter(new FileWriter("output.txt"));
			input = new Scanner(new File("input.txt"));
		} catch (FileNotFoundException h) {
			System.out.println("File not found 1");
			System.exit(0);
		} catch (IOException e) {
			System.out.println("File not found 2");
			System.exit(0);
		}
		
		int count = Integer.parseInt(input.nextLine());
		
		
		for(int i=0;i<count;i+=1) {
			String[] line = input.nextLine().split("[ ]+");
			beatTarget = 0;
			int googlers = Integer.parseInt(line[0]);
			surprise = Integer.parseInt(line[1]);
			int targetScore = Integer.parseInt(line[2]);
			
			for(int y=3;y<line.length;y+=1) {
				bestScore(Integer.parseInt(line[y]),targetScore);
			}
			
			output.println("Case #" + (i+1) + ": " + beatTarget);
			
		}
		

		
		
		
		
		output.close();
		

	}

}
