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.googlecode.codejam.contest.gcj2012.round_q;

import java.util.Arrays;
import java.util.Iterator;
import java.util.concurrent.Callable;

import com.googlecode.codejam.model.JamCaseResolver;
import com.googlecode.codejam.model.JamCaseResolverFactory;
import com.googlecode.codejam.model.JamResolver;

public class B extends JamCaseResolver {

	private final int s; // surprising
	private final int p; // score limit
	
	private final int[] scores;
	
	public B(final int caseNumber, final Iterator<String> lineIterator) {
		super(caseNumber);
		int[] input = this.parseInt(lineIterator.next().split(" "));
		s = input[1];
		p = input[2];
		scores = Arrays.copyOfRange(input, 3, input.length);
	}
	
	@Override
	protected String resolve() {
		int surprisingUsed = s;
		int result = 0;
		for (int score : scores) {
			if(score < 2) {
				if(score >= p)
					result++;
				continue;
			}
			double avg = Math.ceil(score / 3.0);
			
			if(avg >= p) {
				result++;
			} else if (surprisingUsed > 0 && avg + 1 >= p && (score - 1) % 3 != 0) {
				result++;
				surprisingUsed--;
			}
		}
		return String.valueOf(result);
	}

	public static void main(String[] args) throws Exception {
		final JamCaseResolverFactory factory = new JamCaseResolverFactory() {
			@Override
			public Callable<String> newJamCaseResolver(int caseNumber, Iterator<String> lineIterator) {
				return new B(caseNumber, lineIterator);
			}
		};
		final JamResolver jamResolver = new JamResolver(factory, "gcj2012/round_q", "B-small-attempt0.in");
		jamResolver.resolve();
	}

}
