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.util.Scanner;

public class DancingWithTheGooglers {

   public static void main(String[] argv) {

      int lineCounter,numberOfLines,people,currentScore;
      int surprises,scoreToBeat,counter,answer;
      int possibleScore;
      Scanner input = null;

      try {input = new Scanner(System.in);}
      catch (Exception e) { System.err.println("FileNotFoundException: " + e.getMessage()); }

      numberOfLines = input.nextInt();

      for (lineCounter = 0; lineCounter < numberOfLines; lineCounter++) {
         answer = 0;
         input.nextLine();
         people = input.nextInt();
         surprises = input.nextInt();
         scoreToBeat = input.nextInt();

         for (counter = 0; counter < people; counter++) {
            currentScore = input.nextInt();
            possibleScore = scoreNoSurprise(currentScore);
            if (possibleScore >= scoreToBeat)
               answer++;
            else if (surprises > 0) {
               possibleScore = scoreSurprise(currentScore);
               if (possibleScore >= scoreToBeat) {
                  answer++;
                  surprises--;
               }
            }
         }

         System.out.printf("Case #%d: %d\n",lineCounter+1,answer);

      }

   }

   public static int scoreNoSurprise(int value) {
      if (value < 2)
         return value;
      if (value == 2)
         return 1;
      int totalScore = value;
      int divergence = totalScore%3;
      int baseScore = totalScore/3;
      if (divergence == 2) {
         return baseScore+1;
      }
      else if (divergence == 1) {
         return baseScore+1;
      }
      else { // divergence == 0
         return baseScore;
      }
   }

   public static int scoreSurprise(int value) {
      if (value < 3)
         return value;
      int totalScore = value;
      int divergence = totalScore%3;
      int baseScore = totalScore/3;
      if (divergence == 2) {
         return baseScore+2;
      }
      else if (divergence == 1) {
         return baseScore+1;         
      }
      else { // divergence == 0
         return baseScore+1;
      }
   }

}
