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

/*
choochootrain
Google Code Jam 2012
*/
import java.io.*;
import java.util.*;

class ProblemB
{
  public static void main (String [] args) throws IOException 
  {
    String filename = "B-small-attempt0";  
    BufferedReader f = new BufferedReader(new FileReader(filename + ".in"));
    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(filename + ".out")));
    int numberOfTests = Integer.parseInt(f.readLine());
    for(int n = 1; n <= numberOfTests; n++)
    {
      StringTokenizer st = new StringTokenizer(f.readLine());
      int numPeople = Integer.parseInt(st.nextToken());
      int numSurprising = Integer.parseInt(st.nextToken());
      int threshold = Integer.parseInt(st.nextToken());
      ArrayList<Integer> points = new ArrayList<Integer>(numPeople);
      for(int i = 0; i < numPeople; i++) {
        points.add(Integer.parseInt(st.nextToken()));
      }

      int num = 0;
      for(int i = 0; i < points.size(); i++) {
        if(max(makeNormal(points.get(i))) >= threshold) {
          num++;
          points.remove(i);
          i--;
        }
      }

      for(int i = 0; i < points.size() && numSurprising > 0; i++) {
        if(max(makeSurprising(points.get(i))) >= threshold) {
          num++;
          numSurprising--;
          points.remove(i);
          i--;
        }
      }
      String solution = "" + num;
      out.println("Case #" + n + ": " + solution);
    }
    out.close();
    System.exit(0);
  }

  private static int max(int[] nums) {
    if (Math.min(Math.min(nums[0], nums[1]), nums[2]) >= 0)
      return Math.max(Math.max(nums[0], nums[1]), nums[2]);
    else
      return -1;
  }

  private static int[] make (int a, int b, int c) {
    int[] arr = new int[3];
    arr[0] = a;
    arr[1] = b;
    arr[2] = c;
    return arr;
  }

  private static int[] makeNormal(int total) {
    if (total % 3 == 0)
      return make(total/3, total/3, total/3);
    else if (total % 3 == 1)
      return make(total/3, total/3, total/3 + 1);
    else
      return make(total/3, total/3 + 1, total/3 + 1);
  }
  
  private static int[] makeSurprising(int total) {
    if (total % 3 == 0)
      return make(total/3 - 1, total/3, total/3 + 1);
    else if (total % 3 == 1)
      return make(total/3 - 1, total/3 + 1, total/3 + 1);
    else
      return make(total/3, total/3, total/3 + 2);
  }
}
