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 t2012.classification;

import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Scanner;

public class ExB {

	
	
	
	
	public void exec(String filename, String out_filename)
	{
		try{
			FileInputStream fis = new FileInputStream(filename); 
			Scanner s = new Scanner(fis);
			
			FileWriter output_fstream = new FileWriter(out_filename);
			BufferedWriter out = new BufferedWriter(output_fstream);
			
			// The problem
			int T = Integer.parseInt(s.nextLine());
			for(int testNum = 1; testNum <=T; testNum++)
			{
				System.out.println(testNum);
				String line = s.nextLine();
				String[] list = line.split(" ");
				int N = Integer.parseInt(list[0]);
				int S = Integer.parseInt(list[1]);
				int p = Integer.parseInt(list[2]);
				int numGood = 0;
				int numSurp = 0;
				int discarded = 0;
				for(int i = 3; i < N+3; i++)
				{
					int sum = Integer.parseInt(list[i]);
					if(sum >= 3*p-2 && sum >=p)
					{
						numGood++;
					}
					else if(sum < 3*p-2 && sum >= 3*p-4 && sum >=p)
					{
						numSurp++;
					}
					else
					{
						discarded++;
					}
				}
				int result = numGood + Math.min(numSurp,S);
				out.write("Case #"+testNum+": "+result+"\n");
				
			}
			
			// End the problem
			
			out.close();
			output_fstream.close();
		}catch(Exception e)
		{
			System.out.println("Some error occurred");
		}
	}


	public static void main(String args[])
	{
		String PATH= "/home/pau/development/workspace/CodeJam/testfiles/2012/";
		ExB a = new ExB();
		a.exec(PATH + "B-small-attempt0.in", PATH + "B-small-attempt0.out");
		//a.exec(PATH + "B-large-practice.in", PATH + "B-large-practice.out");
	}

}
