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

import java.io.*;
import java.util.Arrays;

public class Glob {

  /**
  * Fetch the entire contents of a text file, and return it in a String.
  * This style of implementation does not throw Exceptions to the caller.
  *
  * @param aFile is a file which already exists and can be read.
  */
  static public void IOwork() {
    //...checks on aFile are elided
    try {
      //use buffering, reading one line at a time
      //FileReader always assumes default encoding is OK!
      BufferedReader input =  new BufferedReader(new FileReader(new File("F:\\file.in")));
      Writer output = new BufferedWriter(new FileWriter(new File("F:\\file.out")));
      try {
        String line = null; //not declared within while loop
        /*
        * readLine is a bit quirky :
        * it returns the content of a line MINUS the newline.
        * it returns null only for the END of the stream.
        * it returns an empty String if two newlines appear in a row.
        */
        line = input.readLine();
        int NoOfCases = Integer.parseInt(line);
        for (int i = 0; i < NoOfCases; i++) {
        	line = input.readLine();
        	String[] v1 = line.split(" ");
        	int t = Integer.parseInt(v1[0]);
        	int s = Integer.parseInt(v1[1]);
        	int p = Integer.parseInt(v1[2]);
        	int answer = 0;
        	System.out.println(t);
        	System.out.println(s);
        	System.out.println(p);
        	for (int j = 3; j < v1.length; j++) {
        		int temp = Integer.parseInt(v1[j]);
        		if (temp > 0) {
        		switch (temp%3) {
        		case 0 : {
        			if (temp/3 >= p) answer++;
        			else if (temp/3+1 == p && s > 0) {
        				answer++;
        				s--;
        			}
        			break;
        		}
        		case 1 : {
        			if (temp/3+1 >= p) answer++;  	
        			break;
        		}
        		case 2 : {
        			if (temp/3+1 >= p) answer++;
        			else if (temp/3+2 == p && s > 0) {
        				answer++;
        				s--;
        			}
        			break;
        		}
        		}
        		}
        		else if (p == 0) answer++;
        	}
        	output.write("Case #"+(i+1)+": "+answer+"\n");
        }
      }
      finally {
        input.close();
        output.close();
      }
    }
    catch (IOException ex){
      ex.printStackTrace();
    }
  }
  
  private static int rope(int[][] lines) {
	  int ans = 0;
	  for (int i = 0; i < lines.length-1; i++){
		  for (int j = i+1; j < lines.length; j++) {
			  if ((lines[i][0] > lines[j][0] && lines[i][1] < lines[j][1])||(lines[i][0] < lines[j][0] && lines[i][1] > lines[j][1]))
				  ans++;
		  }
	  }
	return ans;
  }
  
  public static void main (String[] aArguments) throws IOException {
	  IOwork();
	  }
}