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

package de.pat.dev.y2012.qualification.b;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;

/**
 * @author pat.dev@alice.de
 * @since 14.04.12
 */
public class Main {
  public static void main(String[] args) {
    try {
      BufferedReader reader = new BufferedReader(new FileReader(args[0]));
      int numberOfTestCases = nextInt(reader);
      for (int i = 0; i < numberOfTestCases; i++) {
        StatisticParameters statisticParameters = nextParameters(reader);
        System.out.printf("Case #%d: %s\n", i+1,
          statisticParameters.statistics.numberOfGooglersReaching(statisticParameters.bestScore));
      }
    } catch (IOException e) {
      e.printStackTrace();
    }
  }

  private static StatisticParameters nextParameters(BufferedReader reader) throws IOException {
    String[] params = reader.readLine().trim().split("\\s+");
    int numberOfGooglers = toInt(params[0]);
    int numberOfSurprises = toInt(params[1]);
    int bestScore = toInt(params[2]);
    int[] scores = new int[numberOfGooglers];
    for (int i = 0; i < scores.length; i++) {
      scores[i]=toInt(params[i+3]);
    }
    ScoreStatistics statistics = new ScoreStatistics(numberOfSurprises, scores);
    return new StatisticParameters(bestScore,statistics);
  }
  private static int toInt(String value) {
    return Integer.parseInt(value);
  }

  private static int nextInt(BufferedReader reader) throws IOException {
    return toInt(reader.readLine().trim());
  }

  private static class StatisticParameters {
    public final int bestScore;
    public final ScoreStatistics statistics;

    public StatisticParameters(int bestScore, ScoreStatistics statistics) {
      this.bestScore = bestScore;
      this.statistics = statistics;
    }

    @Override
    public String toString() {
      return "StatisticParameters{" +
        "bestScore=" + bestScore +
        ", statistics=" + statistics +
        '}';
    }
  }
}
