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 codejam.surprisingGooglers;



public class PossibleSurpriseCase {

	private boolean[] surprises;
	private int[] scores;
	
	private PossibleSurpriseCase(int length) {
		surprises = new boolean[length];
		scores = new int[length];
	}

	public int getMaximumPHavers(int p) {
		//System.out.println("Checking for case: "+this);
		int max = 0;
		for (int i = 0; i<scores.length; i++)
			if (canHaveP(scores[i], surprises[i], p)) max++;
		//System.out.println("Can have "+max+" minimums of "+p+".");
		return max;
	}

	private boolean canHaveP(int score, boolean surprise, int p) {
		if (score<2 && surprise) return false;
		score = surprise ? score-2:score;
		switch (score % 3){
		case 0: // clean split
			return (score/3) +(surprise?2:0) >= p;
		case 1: //one is higher
			return ((score-1)/3)+1 +(surprise?1:0) >= p;
		case 2: //one is lower
			return ((score+1)/3)  +(surprise?1:0) >= p;
		default: 
			throw new AssertionError("Cannot happen.");
		}
	}

	public static PossibleSurpriseCase combine(boolean isSurprise,int score, PossibleSurpriseCase other) {
		PossibleSurpriseCase r = new PossibleSurpriseCase(other.getLength()+1);
		r.surprises[0] = isSurprise;
		r.scores[0] = score;
		for(int i=0; i<other.getLength(); i++){
			r.surprises[i+1] = other.surprises[i];
			r.scores[i+1] = other.scores[i];
		}
		return r;
	}


	private int getLength() {
		return surprises.length;
	}

	public static PossibleSurpriseCase trivial() {
		return new PossibleSurpriseCase(0);
	}

	public String toString(){
		StringBuilder r = new StringBuilder();
		for(int i=0; i<scores.length; i++){
			r.append(scores[i]);
			if (surprises[i]) r.append("*");
			r.append(" ");
		}
		return r.toString();
	}
	
}
