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.FileReader;
import java.util.StringTokenizer;


public class B {

  void main2(String[] args) throws Exception {
    BufferedReader br = new BufferedReader(new FileReader(args[0]));
    String line = br.readLine();
    int count = Integer.parseInt(line);
    for (int i = 0; i < count; i++) {
      line = br.readLine();

      // 3 1 5 15 13 11
      StringTokenizer st = new StringTokenizer(line, " ", false);
      int n = Integer.parseInt(st.nextToken());
      int s = Integer.parseInt(st.nextToken());
      int p = Integer.parseInt(st.nextToken());

      int[] t = new int[n];
      for (int j = 0; j < n; j++) {
        t[j] = Integer.parseInt(st.nextToken());
      }

      System.out.println("Case #" + (i + 1) + ": " + max(n, s, p, t));
    }
    br.close();
  }


  private int max(int n, int s, int p, int[] t) {
    int max = 0;

    for (int i = 0; i < n; i++) {

      int r = t[i] % 3;
      int k = t[i] / 3;
      int b = 0;
      int bs = 0;
      switch (r) {
      case 0:
        b = k;
        bs = t[i] == 0 ? 0 : k + 1;
        break;
      case 1:
        b = k + 1;
        bs = t[i] == 1 ? -1 : k + 1;
        break;
      case 2:
        b = k + 1;
        bs = k + 2;
      }

      if (b >= p) {
        max++;
      } else if (bs >= p && s > 0) {
        max++;
        s--;
      }

    }
    return max;
  }



  public static void main(String[] args) throws Exception {
    new B().main2(args);
  }
}
