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

import java.util.*;
import java.io.*;

public class DancingWithGoogle {
    final static String PROBLEM_NAME = "dance";
    final static String WORK_DIR = "D:\\Gcj\\" + PROBLEM_NAME + "\\";

    static int[][] maxBest = new int[31][2];

    static void preprocess() {
        for (int i=0; i<=30; i++)
            Arrays.fill(maxBest[i], -1);

        for (int A=0; A<=10; A++)
            for (int B=A; B<=10 && B<=A+2; B++)
                for (int C=B; C<=10 && C<=A+2; C++) {
                    int tot = A+B+C, sur = (C - A == 2 ? 1 : 0);
                    maxBest[tot][sur] = Math.max(maxBest[tot][sur], C);
                }
    }

    void solve(Scanner sc, PrintWriter pw) {
        int N = sc.nextInt();
        int S = sc.nextInt();
        int p = sc.nextInt();
        int[] tot = new int[N];
        for (int i=0; i<N; i++)
            tot[i] = sc.nextInt();

        int[][] dp = new int[N+1][N+1];
        for (int i=0; i<=N; i++)
            Arrays.fill(dp[i], -100000);
        dp[0][0] = 0;

        for (int pos=0; pos<N; pos++)
            for (int sur=0; sur <= pos; sur++)
                for (int nSur=0; nSur < 2; nSur++)
                    if (maxBest[tot[pos]][nSur] >= 0)
                        dp[pos+1][sur+nSur] = Math.max(dp[pos+1][sur+nSur], dp[pos][sur] + (maxBest[tot[pos]][nSur] >= p ? 1 : 0));

        pw.println(dp[N][S]);
    }

    public static void main(String[] args) throws Exception {
        preprocess();

        Scanner sc = new Scanner(new FileReader(WORK_DIR + "input.txt"));
        PrintWriter pw = new PrintWriter(new FileWriter(WORK_DIR + "output.txt"));
        int caseCnt = sc.nextInt();
        for (int caseNum=0; caseNum<caseCnt; caseNum++) {
            System.out.println("Processing test case " + (caseNum + 1));
            pw.print("Case #" + (caseNum+1) + ": ");
            new DancingWithGoogle().solve(sc, pw);
        }
        pw.flush();
        pw.close();
        sc.close();
    }
}
