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.File;
import java.io.FileWriter;
import java.util.*;

/**
 * Author: Andriy Gusyev
 * Date: 14.04.12
 */
public class Task3 {

    private static class Case {

        private int googlers;

        private int surprising;

        private int minScore;

        private int[] totalScores;

        @Override
        public String toString() {
            return "Case{" +
                    "googlers=" + googlers +
                    ", surprising=" + surprising +
                    ", minScore=" + minScore +
                    ", totalScores=" + Arrays.toString(totalScores) +
                    "}\n";
        }
    }

    private static class Dancer {

        private Integer bestSurprisedScore;

        private Integer bestNonSuprisedScore;

        public Dancer(int totalScore) {
            if (totalScore == 0) {
                bestNonSuprisedScore = 0;
                bestSurprisedScore = 0;
                return;
            }
            switch (totalScore % 3) {
                case 0:
                    bestNonSuprisedScore = totalScore / 3;
                    bestSurprisedScore = totalScore / 3 + 1;
                    if (bestSurprisedScore > 10) {
                        bestSurprisedScore = 10;
                    }
                    break;
                case 1:
                    bestNonSuprisedScore = totalScore / 3 + 1;
                    bestSurprisedScore = totalScore / 3 + 1;
                    if (bestSurprisedScore > 10) {
                        bestSurprisedScore = 10;
                    }
                    break;
                case 2:
                    bestNonSuprisedScore = totalScore / 3 + 1;
                    bestSurprisedScore = totalScore / 3 + 2;
                    if (bestSurprisedScore > 10) {
                        bestSurprisedScore = 10;
                    }
            }
        }

        @Override
        public String toString() {
            return "Dancer{" +
                    "bestNonSuprisedScore=" + bestNonSuprisedScore +
                    ", bestSurprisedScore=" + bestSurprisedScore +
                    "}\n";
        }

        @Override
        public boolean equals(Object o) {
            return false;
        }
    }

    static private int cases;

    static private Case[] objs;

    static private int[] results;

    private static void readInput(String s, int index) {
        s = s.trim();
        String[] arr = s.split(" ");
        Case cas = new Case();
        cas.googlers = Integer.parseInt(arr[0]);
        cas.surprising = Integer.parseInt(arr[1]);
        cas.minScore = Integer.parseInt(arr[2]);
        cas.totalScores = new int[cas.googlers];
        for (int i = 0; i < cas.googlers; i++) {
            cas.totalScores[i] = Integer.parseInt(arr[3 + i]);
        }
        objs[index] = cas;
    }

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

        Scanner sc = new Scanner(new File("d:/codejam/3/small"), "UTF-8");
        cases = Integer.parseInt(sc.nextLine());
        objs = new Case[cases];
        results = new int[cases];
        for (int i = 0; i < cases; i++) {
            readInput(sc.nextLine(), i);
        }

        for (int i = 0; i < cases; i++) {
            results[i] = proceedCase(objs[i]);
        }
        System.out.println(Arrays.toString(results));
        FileWriter fw = new FileWriter(new File("d:/codejam/3/small_out"));
        int k = 0;
        for (int i : results) {
            k++;
            fw.write(String.format("Case #%s: %s\n", String.valueOf(k), String.valueOf(i)));
        }
        fw.close();
    }

    private static int proceedCase(Case cas) {
        int result = 0;
        List<Dancer> dancers = new ArrayList<Dancer>();
        for (int i = 0; i < cas.googlers; i++) {
            dancers.add(new Dancer(cas.totalScores[i]));
        }
        Collections.sort(dancers, new Comparator<Dancer>() {
            public int compare(Dancer o1, Dancer o2) {
                if (o1.bestNonSuprisedScore == o2.bestNonSuprisedScore) {
                    return -o1.bestSurprisedScore.compareTo(o2.bestSurprisedScore);
                }
                return -o1.bestNonSuprisedScore.compareTo(o2.bestNonSuprisedScore);
            }
        });
        System.out.println(dancers);
        int surprisedUsed = 0;
        for (Dancer dancer : dancers) {
            if (dancer.bestNonSuprisedScore >= cas.minScore) {
                result++;
                continue;
            } else if (dancer.bestSurprisedScore >= cas.minScore && cas.surprising > surprisedUsed) {
                result++;
                surprisedUsed++;
                continue;
            }
        }
        return result;
    }
}
