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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Arrays;

public class DancerEvaluation {

    private final int numberOfGooglers;
    private int surpriseCount;
    private final int bestScore;
    private final int[] lstOfPoints;

    public DancerEvaluation(int numberOfGooglers, int surpriseCount, int bestScore, int[] lstOfPoints) {
	this.numberOfGooglers = numberOfGooglers;
	this.surpriseCount = surpriseCount;
	this.bestScore = bestScore;
	this.lstOfPoints = lstOfPoints;

    }

    public int solve() {
	int countOfTotalDancers = 0;
	for (int i = 0; i < lstOfPoints.length; i++) {
	    int avg_point = lstOfPoints[i]/3;
	    int x = avg_point;
	    int y = avg_point;
	    int z = avg_point;

	    int leftOver = lstOfPoints[i] % 3;

	    switch (leftOver) {
	    case 0:
		if(avg_point + 1 == bestScore && surpriseCount > 0 && avg_point > 0){
		    z = z + 1;
		    x = x - 1;
		    surpriseCount--;
		}

   		break;
	    case 1:
		z = z + 1;
		break;
	    case 2:
		 if(surpriseCount > 0 && (z + 2) <= 10){
		    z = z + 2;
		    surpriseCount--;
		}else {
		    z = z+1;
		    y = y+1;
		}
		break;
	    }

	    if(Math.max(Math.max(x, y), z) >= bestScore){
		countOfTotalDancers++;
	    }

	}

	return countOfTotalDancers;
    }

    public static void main(String[] args) throws Exception{
	BufferedReader reader = new BufferedReader(new FileReader(new File("C:\\Users\\maheshsa\\Desktop\\input.txt")));
	int numOfTestCases = Integer.parseInt(reader.readLine());
	FileWriter fw = new FileWriter(new File("C:\\Users\\maheshsa\\Desktop\\output.txt"));
	for (int i = 1; i <= numOfTestCases; i++) {
	    String[] inputAsString = reader.readLine().split(" ");
	    int[] input = new int[inputAsString.length];
	    for (int j = 0; j < inputAsString.length; j++) {
		input[j] = Integer.parseInt(inputAsString[j]);
	    }
	    int numberOfDancers = input[0];
	    int surpriseCount = input[1];
	    int bestScore = input[2];
	    int[] scores = Arrays.copyOfRange(input, 3, input.length);
	    fw.append("Case #" + i + ": " + new DancerEvaluation(numberOfDancers, surpriseCount, bestScore, scores).solve() + "\n");
	}

	fw.flush();

	reader.close();
	fw.close();

    }

}
