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;
	}
}

/**
 * 
 * @author slerig
 *
 */

import java.io.*;
import java.util.*;

public class ScoreChecker {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		File inFile = new File("B-small.in");
		PrintWriter outFile = new PrintWriter("B-small.out");
		Scanner in = new Scanner(inFile);
		
		int cases = in.nextInt();
		for(int i = 1; i <= cases; i++)
		{
			int googlers = in.nextInt();
			int surprising = in.nextInt();
			int minScore = in.nextInt();
			int googlersWithMin = 0;
			int[][] scores = new int[googlers][3];
			
			// Determining individual scores from total scores; before
			// surprising scores are taken into account.
			for(int j = 0; j < googlers; j++)
			{
				float score = in.nextLong();
				float ftemp = score / 3;
				int temp = (int)ftemp;
				if(ftemp - temp > 0.5)
				{
					scores[j][0] = temp + 1;
					scores[j][1] = temp + 1;
					scores[j][2] = temp;
				}
				else if(ftemp - temp > .25)
				{
					scores[j][0] = temp + 1;
					scores[j][1] = temp;
					scores[j][2] = temp;
				}
				else
				{
					for(int k = 0; k < 3; k++)
					{
						scores[j][k] = temp;
					}
				}
			}
			
			// Editing for surprising scores.
			for(int j = 0; j < googlers; j++)
			{
				// Very complicated way of deciding which scores are the surprising scores.
				if(surprising > 0 && scores[j][0] != 0 && scores[j][1] != 0 && scores[j][2] != 0)
					if(scores[j][0] != 10 && (scores[j][0] >= minScore-1 && scores[j][0] < minScore))
						if((scores[j][0] == scores[j][1]))
						{
							scores[j][0]++;
							scores[j][1]--;
							surprising--;
						}
			}
			
			// Checking for googlers with min score.
			for(int j = 0; j < googlers; j++)
			{
				if(scores[j][0] >= minScore)
					googlersWithMin++;
			}
			
			outFile.println("Case #" + i + ": " + googlersWithMin);
			
			/* Debugging code
			outFile.println();
			for(int j = 0; j < googlers; j++)
			{
				for(int k = 0; k < 3; k++)
				{
					outFile.print(scores[j][k] + " ");
				}
				outFile.println();
			}
			*/
		}
		outFile.close();
	}

}
