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.*;
import static java.lang.Math.*;

public class B {
  public static void main(String[] args) throws Exception {
    Scanner sc = new Scanner(new FileReader("B-small-attempt0.in"));
    PrintWriter pw = new PrintWriter(new FileWriter("B-small-output.txt"));
    int T = sc.nextInt();       // number of test cases
    int numResult;
    for (int k=1; k <= T; k++) {
      numResult = 0;
      
      int N = sc.nextInt();     // number of Googlers
      int B = sc.nextInt();     // number of surprising triplet scores
      int p = sc.nextInt();     // "best result" (max of triplets)
      int t[] = new int[N];     // total points for a given Googler (b/t 0 & 30)
      
      int minInd[] = new int[B];
      int minCount = 0;
      
      for (int i=0; i<N; i++) {    // for each of the Googler's total points
        t[i] = sc.nextInt();
      }
      Arrays.sort(t);           // can then start w/ lowest total score
      
      int surpriseCount = 0;    // counts the num of surprising triplets used
      
      for (int i=0; i<N; i++) {    
        // check possible scores:
        if (surpriseCount<B) {
          firstScore: for (int num1=0; num1<11; num1++) {
            for (int num2=min(num1+2,10); num2>=num1; num2--) {
              for (int num3=min(num1+2,10); num3>=num1; num3--) {
                if ((num1+num2+num3)==t[i]) {
                  if (max(num2, num3)>=p) {
                    if (max(num2, num3) > (num1+1)) {
                      surpriseCount++;
                    }
                    numResult++;
                    break firstScore;
                  }
                }
              }
            }
          }
        } else {
          firstScore: for (int num1=0; num1<11; num1++) {
            for (int num2=min(num1+1,10); num2>=num1; num2--) {
              for (int num3=min(num1+1,10); num3>=num1; num3--) {
                if ((num1+num2+num3)==t[i]) {
                  if (max(num2, num3)>=p) {
                    numResult++;
                    break firstScore;
                  }
                }
              }
            }
          }
        }
      }
      
      pw.format("Case #%d: %d\n", k, numResult);
    }
    
    pw.flush();
    pw.close();
    sc.close();
  }
}