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 com.self.code.jam.twelve;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.Reader;

public class DancingScores {

	public static void main(String[] argv)
	{
		try
		{
			long startTime = System.currentTimeMillis();
			Reader reader = new FileReader("D:\\workspace\\Learn\\src\\com\\self\\code\\jam\\twelve\\input\\dancing\\B-small-attempt0.in");
			BufferedReader bufReader = new BufferedReader(reader);
			String x = bufReader.readLine();
			int count = 0;

			File file = new File("D:\\workspace\\Learn\\src\\com\\self\\code\\jam\\twelve\\output\\dancing\\B-small-attempt0.out");
			FileWriter writer = new FileWriter(file);
			
			while((x = bufReader.readLine()) != null)
			{
				count++;
				String res = DancingScores.getMaxBestResult(x);
				if (count == 1)
					writer.write("Case #"+count+": " + res);
				else
					writer.write("\nCase #"+count+": " + res);
			}
			writer.close();
			System.out.println("Total time = " +( System.currentTimeMillis() - startTime));
		}
		catch (Exception e) {
			e.printStackTrace();
		}
	}

	private static String getMaxBestResult(String input) {
		String[] numbers = input.split(" ");
		if(numbers.length <= 3)
			return "0";
		int N = Integer.parseInt(numbers[0]);
		int S = Integer.parseInt(numbers[1]);
		int P = Integer.parseInt(numbers[2]);

		int maxBestResult = 0;
		
		for (int i=3; i<(3+N); i++)
		{
			int number = Integer.parseInt(numbers[i]);
			int division = number/3 ;
			int remainder = number % 3;
			
			if (remainder == 0)
			{
				if (division >= P)
				{
					maxBestResult ++;
				}
				else if ((S != 0) && ((division + 1) >= P) && (division !=0))
				{
					S--;
					maxBestResult ++;
				}
			}
			else if (remainder == 1)
			{
				if ((division + 1) >= P)
				{
					maxBestResult ++;
				}
				// it can not be a Surprising case
			}
			else if (remainder == 2)
			{
				if ((division + 1) >= P)
				{
					maxBestResult ++;
				}
				else if ((S != 0) && ((division + 2) >= P))
				{
					S--;
					maxBestResult ++;
				}
			}
		}
		return String.valueOf(maxBestResult);
	}
}
