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.dancingwithgooglers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;


public class Main {

	public static void main(String[] args) throws Exception {
		String[] files = {
				"Data/B-small-attempt1"
				};


		for (int f = 0; f < files.length; f++) {
			BufferedReader in = new BufferedReader(new FileReader(files[f] + ".in"));
			BufferedWriter out = new BufferedWriter(new FileWriter(files[f] + ".out"));

			int T = Integer.parseInt(in.readLine()); // number of test cases

			for (int i = 1; i <= T; i++) {
				String[] input = in.readLine().split(" ");
				int googlers = Integer.parseInt(input[0]);
				int suprizing = Integer.parseInt(input[1]);
				int p = Integer.parseInt(input[2]);
				int [] t = new int[googlers];
				
				for (int j = 0; j < input.length - 3; j++)
					t[j] = Integer.parseInt(input[j+3]);
				
				int m = getBest(googlers, suprizing, p, t); 
				
			
				out.write(String.format("Case #%d: %d\n", i, m));
			}

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

		}
		
	}

	private static int getBest(int N, int S, int p, int[] t) {
		int output = 0;

		System.out.println(String.format("%d %d %d", N, S, p));
		
		for (int i = 0; i < t.length; i++) {
			System.out.println(String.format("%d", t[i]));

			if (t[i] >= (3*p - 2) && t[i] > 0 || p == 0) output++;
			else if (t[i] >= (3*p - 4) && t[i] > 0 && S > 0)
			{
				System.out.println(String.format("%d %d", t[i], (3*p - 4) ));
				System.out.println("surprise");
				S--;
				output++;
			}
		
		}
		
		return output;

	}

}
