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

public class ProblemB {

    private static final int[] bestSurprise = new int[31];
    private static final int[] bestBoring = new int[31];

    private static void seed() {
	Arrays.fill(bestSurprise, -1);
	Arrays.fill(bestBoring, -1);
	for (int i = 0; i <= 10; i++) {
	    for (int j = Math.max(0, i - 2); (j <= i + 2) && (j <= 10); j++) {
		for (int k = Math.max(0, i - 2); (k <= i + 2) && (k <= 10); k++) {
		    if (Math.abs(k - i) > 2 || Math.abs(k - j) > 2 || Math.abs(i - j) > 2) {
			continue;
		    }
		    int total = i + j + k;
		    int max = Math.max(i, Math.max(j, k));
		    if (Math.abs(k - i) == 2 || Math.abs(k - j) == 2 || Math.abs(i - j) == 2) {
			bestSurprise[total] = Math.max(bestSurprise[total], max);
		    } else {
			bestBoring[total] = Math.max(bestBoring[total], max);
		    }
		}
	    }
	}
    }


    public static int solve(int[] scores, int S, int P) {
	int[][] history = new int[scores.length + 1][S + 1];
	for (int[] cases : history) {
	    Arrays.fill(cases, -1);
	}
	return solve(scores, 0, S, P, history);
    }

    private static int solve(int[] scores, int index, int S, int P, int[][] history) {
	if (index >= scores.length) {
	    if (S > 0) {
		return -1;
	    } else {
		return 0;
	    }
	} else if (S < 0) {
	    return -1;
	} else if (history[index][S] != -1) {
	    return history[index][S];
	}
	int best = -1;
	if (S > 0 && bestSurprise[scores[index]] != -1) {
	    int surpriseAttempt = solve(scores, index + 1, S - 1, P, history);
	    if (surpriseAttempt != -1) {
		best = Math.max(best, surpriseAttempt + (bestSurprise[scores[index]] >= P ? 1 : 0));
	    }
	}
	if (bestBoring[scores[index]] != -1) {
	    int boringAttempt = solve(scores, index + 1, S, P, history);
	    if (boringAttempt != -1) {
		best = Math.max(best, boringAttempt + (bestBoring[scores[index]] >= P ? 1 : 0));
	    }
	}
	history[index][S] = best;
	return best;
    }

    public static void main(String[] args) throws Exception {
	seed();
	Scanner input = new Scanner(System.in);
	int T = Integer.parseInt(input.nextLine().trim());
	for (int i = 0; i < T; i++) {
	    String[] tokens = input.nextLine().split(" ");
	    int N = Integer.parseInt(tokens[0].trim());
	    int S = Integer.parseInt(tokens[1].trim());
	    int P = Integer.parseInt(tokens[2].trim());
	    int[] scores = new int[N];
	    for (int j = 0; j < N; j++) {
		scores[j] = Integer.parseInt(tokens[3 + j].trim());
	    }
	    System.out.println("Case #" + (i+1) + ": " + solve(scores, S, P));
	}
    }
}