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 rounds.qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class B_dancing_with_the_googlers {

	public static void main(String[] args) throws IOException {

		BufferedReader reader = null;
		BufferedWriter writer = null;
		
		try {
			reader = new BufferedReader(new FileReader("./input"));
			writer = new BufferedWriter(new FileWriter("output"));
			int numberOfCases = Integer.valueOf(reader.readLine());
			for (int i = 1; i <= numberOfCases; i++) {
				String line = reader.readLine();
				StringBuilder sb = new StringBuilder("Case #" + i + ": ");
				Scanner scanner = new Scanner(line);
				int result = 0;
				while(scanner.hasNextInt()) {
					int numberOfGooglers = scanner.nextInt();
					int numberOfSurprisings = scanner.nextInt();
					int scoreToReach = scanner.nextInt();
					
					while(numberOfGooglers>0) {
						int googlerScore = scanner.nextInt();
						int div = googlerScore/3;
						int mod =( googlerScore % 3 == 0) ? 0 : 1;
						int highest =  div + mod;
						if(highest>=scoreToReach) {
							result++;
						}
						else if(googlerScore > 0 && highest+1 == scoreToReach && numberOfSurprisings > 0) {
							result++;
							numberOfSurprisings--;
						}
						numberOfGooglers--;
					}
					sb.append(result);
				}
				sb.append("\n");
				writer.write(sb.toString());
			}
		} finally {
			if (reader != null) {
				reader.close();
			}
			if(writer!=null) {
				writer.flush();
				writer.close();
			}
		}
	}

	
}
