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.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

/**
 *
 * @author Westy92
 */

public class Dancing
{

   private BufferedReader stdin;

   /**
    * This method reads lines of input and sends them to a process method.
    * @throws IOException makes the compiler happy! :)
    */
   public void run() throws IOException
   {
      String line;
      int cases = 0, caseNum = 1;
      boolean done = false;
      stdin = new BufferedReader(new InputStreamReader(System.in));
      line = stdin.readLine();
      cases = Integer.parseInt(line);
      while (!done && cases >= caseNum)
      {
         line = stdin.readLine(); // returns null if end of input reached

         if (line == null)
         {
            done = true;
         }
         else
         {
            int output = readLine(line);
            System.out.println("Case #" + caseNum + ": " + output);
            caseNum++;
         }
      }
   }

   private int readLine(String line)
   {
      int goodCases = 0, keepTrack = 0;
      StringTokenizer st = new StringTokenizer(line);
      //Get num of Googlers
      int googlers = Integer.parseInt(st.nextToken());
      //Get num of Special Cases
      int numSpecial = Integer.parseInt(st.nextToken());
      //Get num to be greater than
      int num = Integer.parseInt(st.nextToken());
      while (st.hasMoreTokens() && keepTrack < googlers)
      {
         int temp = Integer.parseInt(st.nextToken());
         if (temp >= (num*3) - 2)
            goodCases++;
         else if (temp >= (num*3) - 4 && numSpecial > 0 && temp >= num)
         {
            goodCases++;
            numSpecial--;
         }
         keepTrack++;
      }
      return goodCases;
   }


   public static void main(String args[])
   {
      try
      {
         new Dancing().run();
      }
      catch (IOException ex)
      {
         ex.printStackTrace();
      }

   }

}
