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 birgit.vera.schmidt.googlecodejam2012.qual;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;

public class B {
  public static void main(String[] args) {
    try {
      String filename = "B-small-attempt0";
      BufferedReader in = new BufferedReader(new FileReader(new File(filename + ".in")));
      PrintStream out = new PrintStream(new FileOutputStream(new File(filename + ".out")));

      int t = Integer.parseInt(in.readLine());

      for (int i = 0; i < t; i++) {
        out.println("Case #" + (i+1) + ": " + calcCase(in.readLine()));
      }

    } catch (IOException e) {
      // Just crash.
      e.printStackTrace();
    }
  }

  private static int calcCase(String line) {
    String[] parts = line.split(" ");
    int n = Integer.parseInt(parts[0]);
    int s = Integer.parseInt(parts[1]);
    int p = Integer.parseInt(parts[2]);
    int[] g = new int[n];
    for (int i = 0; i < n; i++) {
      g[i] = Integer.parseInt(parts[i+3]);
    }

    int ok = 0;
    int okWithSurprising = 0;
    int notOk = 0;

    int limitOkWithoutSurprising = 3*p-2;
    int limitOkWithSurprising = Math.max(3*p-4, 2);

    for (int score : g) {
      if (score >= limitOkWithoutSurprising) {
        ok++;
      } else if (score >= limitOkWithSurprising) {
        okWithSurprising++;
      } else {
        notOk++;
      }
    }

    return ok + Math.min(okWithSurprising, s);
  }
}
