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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

import static java.lang.Math.abs;
import static java.lang.Math.max;

public class DancingWithGooglers {

    public static void main(String[] args) throws IOException {
        new DancingWithGooglers().solveAll();
    }

    BufferedReader reader;

    int T;

    private void solveAll() throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
        T = Integer.parseInt(reader.readLine());
        for (int i = 0; i < T; i++) {
            solve(i + 1);
        }
    }

    private void solve(int caseNumber) throws IOException {
        String line = reader.readLine();
        String[] strings = line.split(" ");
        int N = Integer.parseInt(strings[0]);
        int S = Integer.parseInt(strings[1]);
        int P = Integer.parseInt(strings[2]);
        int[] scores = new int[N];
        for (int i = 0; i < N; i++) {
            scores[i] = Integer.parseInt(strings[3 + i]);
        }

        Triplet[] bestTriplets = new Triplet[N];
        Triplet[] bestSurprisingTriplets = new Triplet[N];

        for (int i = 0; i < N; i++) {
            //System.out.println("Score: " + scores[i]);
            bestTriplets[i] = findBestTriplet(scores[i]);
            bestSurprisingTriplets[i] = findBestSurprisingTriplet(scores[i]);
            //System.out.println(bestTriplets[i] + " - " + "*" + bestSurprisingTriplets[i]);
        }

        int result = 0;
        for (int i = 0; i < N; i++) {
            if (bestTriplets[i].scores[0] >= P) {
                result++;
            }
        }
        int usedSurprising = 0;
        for (int i = 0; i < N; i++) {
            if (bestSurprisingTriplets[i].scores[0] >= P
                    && bestTriplets[i].scores[0] < P
                    && usedSurprising < S) {
                result++;
                usedSurprising++;
            }
        }

        System.out.println("Case #" + caseNumber + ": " + result);
    }

    private Triplet findBestTriplet(int score) {
        for (int i = 10; i >= 0; i--) {
            for (int j = i; j >= max(i - 1, 0); j--) {
                for (int k = j; k >= max(j - 1, 0); k--) {
                    if (i + j + k == score && i - k <= 1) {
                        return new Triplet(i, j, k);
                    }
                }
            }
        }
        return null;
    }

    private Triplet findBestSurprisingTriplet(int score) {
        for (int i = 10; i >= 0; i--) {
            for (int j = i; j >= max(i - 2, 0); j--) {
                for (int k = j; k >= max(j - 2, 0); k--) {
                    if (i + j + k == score && i - k <= 2) {
                        return new Triplet(i, j, k);
                    }
                }
            }
        }
        return null;
    }

    class Triplet {
        int[] scores;

        public Triplet(int s1, int s2, int s3) {
            scores = new int[] {s1, s2, s3};
        }

        @Override
        public String toString() {
            return scores[0] + " " + scores[1] + " " + scores[2];
        }
    }

}
