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

public class DancingWithGooglers {

  BufferedReader br;
  StringTokenizer st = new StringTokenizer("");

  private void solve() throws IOException {
//    final String IO_FILE = null;

    final String IO_FILE = "./B/B-small-attempt0";
    final PrintWriter pw;
    if (IO_FILE == null) {
      br = new BufferedReader(new InputStreamReader(System.in));
      pw = new PrintWriter(System.out);
    } else {
      br = new BufferedReader(new FileReader(IO_FILE + ".in"));
      pw = new PrintWriter(IO_FILE + ".out");
    }
    int testCases = nextInt();
    for (int ti = 1; ti <= testCases; ti++) {
      int n = nextInt();
      int s = nextInt();
      int p = nextInt();
      int[] pointSums = new int[n];
      for (int i = 0; i < n; i++) {
        pointSums[i] = nextInt();
      }
      int ans = find(n, s, p, pointSums);
      pw.println("Case #" + ti + ": " + ans);
    }
    br.close();
    pw.close();
  }

  private int find(int n, int s, int p, int[] pointSums) {
    int[][] d = new int[n + 1][s + 1];
    d[0][0] = 0;
    for (int i = 0; i < n; i++) {
      final int sum = pointSums[i];
      for (int j = 0; j <= s; j++) {
        int maxRegularPoint = calcMaxRegularPoint(sum);
        if (p <= maxRegularPoint) {
          d[i + 1][j] = Math.max(d[i + 1][j], d[i][j] + 1);
        }
        else {
          d[i + 1][j] = Math.max(d[i + 1][j], d[i][j]);
          int maxSurprisingPoint = calcMaxSurprisingPoint(sum);
          if (sum >= 2 && p <= maxSurprisingPoint && j != s) {
            d[i + 1][j + 1] = Math.max(d[i + 1][j + 1], d[i][j] + 1);
          }
        }
      }
    }
    int ans = 0;
    for (int j = 0; j <= s; j++) {
      ans = Math.max(ans, d[n][j]);
    }
    return ans;
  }

  private int calcMaxRegularPoint(int sum) {
    return (sum + 2) / 3;
  }

  int calcMaxSurprisingPoint(int sum) {
    return (sum + 4) / 3;
  }

  String nextString() throws IOException {
    while (!st.hasMoreTokens()) {
      st = new StringTokenizer(br.readLine());
    }
    return st.nextToken();
  }

  int nextInt() throws IOException {
    return Integer.parseInt(nextString());
  }

  public static void main(String[] args) throws IOException {
    new DancingWithGooglers().solve();
  }
}
