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.FileNotFoundException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class Googlers implements Runnable {
    final Scanner in;
    final PrintWriter out;

    public Googlers() throws FileNotFoundException {
        out = new PrintWriter(getClass().getName().toLowerCase() + ".out");
        in = new Scanner(new File(getClass().getName().toLowerCase() + ".in"));
    }

    public static void main(String[] args) {
        try {
            new Googlers().run();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }

    public void run() {
        int tests = in.nextInt();
        for (int testcase = 1; testcase <= tests; testcase++) {
            out.print("Case #" + testcase + ": ");

            int n = in.nextInt();
            int s = in.nextInt();
            int p = in.nextInt();

            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
            }

            Set<Integer> surprise = new HashSet<Integer>();
            Set<Integer> standard = new HashSet<Integer>();

            for (int i = 0; i <= 10; i++) {
                for (int j = i; j <= 10; j++) {
                    for (int k = j; k <= 10; k++) {
                        if (k - i > 2) {
                            break;
                        }

                        if (k < p) {
                            continue;
                        }

                        if (k - i == 2) {
                            surprise.add(i + j + k);
                        } else {
                            standard.add(i + j + k);
                        }
                    }
                }
            }

            int[][] dyn = new int[n + 1][s + 1];
            for (int i = 1; i <= n; i++) {
                for (int j = 0; j <= s; j++) {
                    if (surprise.contains(a[i - 1]) && j > 0) {
                        dyn[i][j] = Math.max(dyn[i][j], dyn[i - 1][j - 1] + 1);
                    }
                    if (standard.contains(a[i - 1])) {
                        dyn[i][j] = Math.max(dyn[i][j], dyn[i - 1][j] + 1);
                    }
                    dyn[i][j] = Math.max(dyn[i][j], dyn[i - 1][j]);
                }
            }
            out.println(dyn[n][s]);
        }

        out.close();
        in.close();
    }
}
