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

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;

public class B {

	public static void main(String[] args) {
		int totalCase = 0;
		int supriseCaseNo = 0;
		int googlerNo = 0;
		int p = 0;
		FileInputStream is = null;
		try {
			is = new FileInputStream(args[0]);
			Scanner scan = new Scanner(is);
			totalCase = scan.nextInt();
			for (int i = 0; i < totalCase; i++) {
				googlerNo = scan.nextInt();
				supriseCaseNo = scan.nextInt();
				p = scan.nextInt();
				int[] scores = new int[googlerNo];
				for (int j = 0; j < googlerNo; j++) {
					scores[j] = scan.nextInt();
				}
				solve(i, googlerNo, supriseCaseNo, p, scores);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} finally {
			try {
				is.close();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
	}

	private static void solve(int caseNo, int googlerNo, int supriseCaseNo, int p,
			int[] scores) {
		int answer = 0;
		int t = supriseCaseNo;
		for (int i = 0; i < googlerNo; i++) {
			// ½ÏlÌvZ
			int avg = scores[i] / 3;
			int mod = scores[i] % 3;
			int diff = avg - p;
			if (diff <= -3) { 
				continue;
			} else if (diff >= 0) {
				answer++;
			} else if (diff == -1) {
				if (mod == 0) {
					if (t > 0 && p > 1) {
						t--;
						answer++;
					} else {
						continue;
					}
				} else {
					answer++;
				}
			} else if (diff == -2) {
				if (mod == 0 || mod == 1) {
					continue;
				} else if (mod == 2) {
					if (t > 0) {
						t--;
						answer++;
					}
				}
			}
		}
		StringBuilder sb = new StringBuilder();
		sb.append("Case #");
		sb.append(caseNo+1);
		sb.append(": ");
		sb.append(answer);
		System.out.println(sb.toString());
		
	}
}
