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

public class b {
  
  public static void main (String[] args){
    
    //settingup input and output
    Scanner in = null;
    PrintWriter out = null;
    try{
      in = new Scanner(new File("bsmall.txt"));
      out = new PrintWriter(new FileOutputStream("bsmallout.txt"), true);
    }catch(Exception e){
      System.out.println("file not found");
    }
    
    // number of cases
    int n = in.nextInt(); 
    in.nextLine();
    
    // run through each case
    for(int currentCase = 1; currentCase <= n; currentCase++){
      
      int result = 0;
      int N = in.nextInt(); // number of Googlers
      int S = in.nextInt(); // number of surprising triplets
      int p = in.nextInt(); // must be >= p to be considered
      int t[] = new int[N]; // total point for each Googler
      for(int i = 0; i < N; i++){
        t[i] = in.nextInt();
      }
      
      for(int i = 0; i < N; i++){
        if(t[i] >= (p*3 - 2)) result++; // automatically pass
        else if((S > 0) && ((((p*3 - 3) > 0) && (t[i] == (p*3 - 3)))  
                              || (((p*3 - 4) > 0) && (t[i] == (p*3 - 4))))){
          result++;
          S--; // consumes a quota of surprising triplet to pass
        }
      }
      
      //output answers for each case
      out.println("Case #" + currentCase + ": " + result);
    }
    
    // close input and output streams
    in.close();
    out.close();
  } 
}