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 problemB;

import java.io.IOException;
import java.util.LinkedList;

import utils.InputReader;

public class SolverB {

	public static void main(String[] args) throws IOException {
		LinkedList<String> input = InputReader.read("C:/Users/Danielle/Desktop/test.txt");
		int num = Integer.parseInt(input.removeFirst());
		int i = 1;
		for (String string : input) {
			if (i > num) {
				System.err.println(i+">"+num);
				break;
			}
			if (i == 3){
				System.out.print("");
			}
			String[] split = string.split(" ");
			int dancers = Integer.parseInt(split[0]);
			int supplies = Integer.parseInt(split[1]);
			int targetScore = Integer.parseInt(split[2]);

			boolean hasSupplies = supplies>0;

			int couldBeAbove = 0;

			for (int k = 3; k < dancers+3; k++){
				int total = Integer.parseInt(split[k]);
				if (total == 0 && targetScore > 0) continue;
				if (total > 27){
					if (targetScore < 11) couldBeAbove++;
					continue;
				}
				int avg = total/3;
				int lacking = targetScore-avg;
				if (lacking < 1) couldBeAbove++;
				else if (lacking > 2) continue;
				else {
					int rest = total%3;
					if (rest == 1){
						if (lacking == 1) couldBeAbove++;
					} else if (hasSupplies){
						switch(rest){
						case 2:
							switch (lacking) {
							case 1:
								couldBeAbove++;
								break;
							case 2:
								couldBeAbove++;
								hasSupplies = (--supplies)>0;
								break;
							}
							break;
						case 0:
							if (lacking == 1){
								couldBeAbove++;
								hasSupplies = (--supplies)>0;
							}
							break;
						}
					} else {
						if (rest == 2 && lacking == 1) couldBeAbove++;
					}
				}
			}
			System.out.println("Case #"+(i++)+": "+couldBeAbove);
		}
	}
}
