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 ch.socaciu.andrei.codejam;

import java.io.*;
import java.util.ArrayList;
import java.util.List;

/**
 * @author Andrei Socaciu
 */
public class Dancing {

    public static void main(String[] args) throws Exception {
        String in = "data/Dancing-small-attempt0.in.txt";
        String out = "data/Dancing-small-attempt0.out.txt";
        String line = null;
        BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream(in)));
        List<String> lines = new ArrayList<String>();
        while ((line = reader.readLine()) != null) {
            lines.add(line);
        }
        reader.close();
        int tests = Integer.parseInt(lines.get(0));
        List<String> res = new ArrayList<String>();
        int k = 1;
        for (int i = 1; i <= tests; i++) {
            line = lines.get(k++);
            String[] parts = line.split(" ");
            int n = Integer.parseInt(parts[0]);
            int[] scores = new int[n];
            int s = Integer.parseInt(parts[1]);
            int p = Integer.parseInt(parts[2]);
            for (int j = 0; j < n; j++) {
                scores[j] = Integer.parseInt(parts[3+j]);
            }
            int result = solve(scores, s, p);
            res.add("Case #" + i + ": " + result);
        }
        BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(new FileOutputStream(out)));
        for (String re : res) {
            writer.write(re);
            writer.write("\n");
        }
        writer.close();
    }

    private static int solve(int[] scores, int s, int p) {
        int count = 0;
        int special = s;
        for (int score : scores) {
            if (score / 3 >= p) {
                //avg. larger than p, at least one score will be >= p
                count++;
            } else if (score == 3*p - 1 || score == 3*p - 2) {
                //these are covered by the not-special cases
                count++;
            } else if (special > 0) {
                //try to see if a special case matches
                if (score % 3 == 0) { //s-1,s,s+1
                    if (score / 3 + 1 >= p && score / 3 - 1 >= 0)  {
                        count++;
                        special--;
                    }
                } else if (score % 3 == 1) {//s,s,s-2
                    if ((score + 2) / 3 >= p) {
                        count++;
                        special--;
                    }
                } else {//s,s,s+2
                    if ((score - 2) / 3 + 2 >= p) {
                        count++;
                        special--;
                    }
                }
            }
        }
        return count;
    }

}
