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

public class QualBDancingWithTheGooglers
{
   static boolean debug = false;

   public static void main(String[] args)
   {
      Utils.openInFile("B-small-attempt0.in");
      Utils.openOutFile("out.txt", debug);
      String input = Utils.readFromFile();
      int lineCount = Integer.parseInt(input);

      //while ((input = Utils.readFromFile()) != null)
      for (int line = 1; line <= lineCount; line++)
      {
         if (debug) System.out.println();
         input = Utils.readFromFile();
         String[] split = input.split(" ");
         int Number = Integer.parseInt(split[0]),
             Surprising = Integer.parseInt(split[1]),
             points = Integer.parseInt(split[2]);
         int[] allPoints = new int[Number];
         for (int j = 0; j < Number; j++)
            allPoints[j] = Integer.parseInt(split[j+3]);
         String output = "";

         int mustBeSurprisingCount = 0, count = 0;
         
         for (int sumP: allPoints)
         {
            int mod = sumP%3;
            int third = sumP/3;
            int minP = third, maxP = third, minPSup = third, maxPSup = third;
            switch (mod)
            {
               case 0: minPSup--; maxPSup++; break;
               case 1: maxP++; minPSup--; maxPSup++; break;
               case 2:
               default:maxP++; maxPSup+=2;
            }
            if (debug) System.out.println("third="+third);
            if (points <= maxP)
               count++;
            else if (2 <= sumP && sumP <= 28 && points <= maxPSup)
               mustBeSurprisingCount++;
         }

         if (debug)
         {
            System.out.println("input="+input);
            System.out.println("count="+count);
            System.out.println("mustBeSurprisingCount="+mustBeSurprisingCount);
         }
         output = "Case #" + line + ": ";
         output += (count + Math.min(mustBeSurprisingCount, Surprising));
         Utils.writeToFile(output);
      }
      Utils.closeInFile();
      Utils.closeOutFile();
   }
}
