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;
	}
}

package google.codejam;


import java.util.HashMap;

public class GooglereseSolver implements GoogleSolver{
  
  static HashMap<String, String> map = new HashMap<String, String>();
  
  public static void calcualteMapping(){
    String in[] = new String[]{
        "ejp mysljylc kd kxveddknmc re jsicpdrysi", 
        "rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd",
        "de kr kd eoya kw aej tysr re ujdr lkgc jv"};
    
    String out[] = new String[]{
        "our language is impossible to understand",
        "there are twenty six factorial possibilities",
        "so it is okay if you want to just give up"};
    
    int count = 0;
    map.put("y","a");
    map.put("e","o");
    map.put("q","z");
    map.put(" "," ");
    
    for(int i=0 ; i<in.length ; i++){
      for(int j=0 ; j<in[i].length() ; j++){
        String inC = in[i].charAt(j)+"";
        String outC = out[i].charAt(j)+"";
        if(inC.equalsIgnoreCase(" "))continue;
        
        if(map.containsKey(inC)){
          if(!map.get(inC).equalsIgnoreCase(outC+""))
            System.out.println("Different mapping?"+ inC +"->"+map.get(inC) + ", actual:"+outC);
        }else{
          System.out.println("Add mapping:"+ inC +"->"+outC);
          map.put(inC+"", outC+"");
          count++;
        }
      }
    }
    
    
    char missingKey = ' ';
    char missingValue = ' ';
    char check = 'a';
    for(int i=0 ; i<26 ; i++){
      char target = (char)(check+i);
      //System.out.println("check:"+target);
      if(!map.containsKey(target+"")){
        System.out.println("missing Key:"+target);
        missingKey = target;
      }
      
      if(!map.containsValue(target+"")){
        System.out.println("missing Value:"+target);
        missingValue = target;
      }
    }
    map.put(missingKey+"", missingValue+"");
    
    System.out.println("Total mapping:"+ count +"->" + map.size());
  }
    

  @Override
  public String solve(String str) {
    StringBuilder sb = new StringBuilder();
    for(int i=0 ; i<str.length() ; i++){
      sb.append(map.get(str.charAt(i)+""));
    }
    return sb.toString();
  }

}
