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 br.ufmg.dcc.codejam.problemas;

import java.io.FileNotFoundException;
import java.io.IOException;

import br.ufmg.dcc.codejam.util.ArquivoEscrita;
import br.ufmg.dcc.codejam.util.ArquivoLeitura;

/**
 * Solution for Problem B (Dancing With the Googlers) of Google Code Jam 2012
 * @author Marcio
 *
 */
public class ProblemB
{
	/**
	 * Number of test cases
	 */
	private int m_numTestCases;
	
	/**
	 * Input file
	 */
	private ArquivoLeitura m_inputFile;
	
	/**
	 * Output file
	 */
	private ArquivoEscrita m_outputFile;
	
	/**
	 * Constructor
	 * @param p_inputFile The input file for the problem
	 * @param p_outputFile The output file for the problem
	 */
	public ProblemB(ArquivoLeitura p_inputFile, ArquivoEscrita p_outputFile)
	{
		m_inputFile = p_inputFile;
		m_outputFile = p_outputFile;
		m_numTestCases = Integer.parseInt(p_inputFile.lerLinha());
	}
	
	/**
	 * Main method
	 * @param p_args Program arguments. Argument 0 is the input file name and argument 1 is the output file name
	 */
	public static void main(String[] p_args)
	{
		ArquivoLeitura v_inputFile = null;
		ArquivoEscrita v_outputFile = null;
		
		try
		{
			v_inputFile = new ArquivoLeitura(p_args[0]);
			v_outputFile = new ArquivoEscrita(p_args[1]);
			
			ProblemB v_problemB = new ProblemB(v_inputFile, v_outputFile);
			v_problemB.solve();
		}
		catch (FileNotFoundException v_exception)
		{
			System.out.println("File not found!");
			v_exception.printStackTrace();
		}
		catch (IOException v_exception)
		{
			System.out.println("IO error!");
			v_exception.printStackTrace();
		}
		finally
		{
			if(v_inputFile != null)
			{
				v_inputFile.fechar();
			}
			if(v_outputFile != null)
			{
				v_outputFile.fechar();
			}
		}
	}

	/**
	 * Solves the problem
	 */
	private void solve()
	{
		for(int v_numTestCase = 1; v_numTestCase <= m_numTestCases; v_numTestCase++)
		{
			solveTestCase(v_numTestCase, m_inputFile.lerLinha());
		}
	}

	/**
	 * Solves a test case
	 * @param p_numTestCase Number of the test case
	 * @param p_inputLine Input line of the test case
	 */
	private void solveTestCase(int p_numTestCase, String p_inputLine)
	{
		m_outputFile.escrever("Case #" + p_numTestCase + ": ");
		
		String[] v_data = p_inputLine.split(" ");
		
		@SuppressWarnings("unused")
		int v_numGooglers = Integer.parseInt(v_data[0]);
		int v_numSurprises = Integer.parseInt(v_data[1]);
		int v_bestResult = Integer.parseInt(v_data[2]);
		int v_answer = 0;
		
		int v_minScoreWithoutSurprises = 0; 
		int v_minScoreWithSurprises = 0; 	
		
		if(v_bestResult == 0)
		{
			v_minScoreWithoutSurprises = 0;
			v_minScoreWithSurprises = 0;
		}
		else if(v_bestResult == 1)
		{
			v_minScoreWithoutSurprises = 1;
			v_minScoreWithSurprises = 1;
		}
		else
		{
			v_minScoreWithoutSurprises = (3*v_bestResult) - 2;
			v_minScoreWithSurprises = v_minScoreWithoutSurprises - 2;
		}
		
		for(int i = 3; i < v_data.length; i++)
		{
			int v_totalPoints = Integer.parseInt(v_data[i]);
			
			if(v_totalPoints >= v_minScoreWithoutSurprises)
			{
				v_answer++;
			}
			else if(v_numSurprises > 0 && v_totalPoints >= v_minScoreWithSurprises)
			{
				v_answer++;
				v_numSurprises--;
			}
		}
		m_outputFile.escrever(String.valueOf(v_answer));
		
		if(p_numTestCase != m_numTestCases)
		{
			m_outputFile.escreverLinha("");
		}
	}
}
