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 ponder.CodeJamQualify;

import java.io.*;
import java.util.StringTokenizer;

/**
 * @author: sg  Date: 15.04.12
 */
public class TaskB
{
	static int calc(final int p, final int strangeOrig, final int[] marks)
	{
		int cnt = 0;
		int strange = strangeOrig;
		for (int total : marks)
		{
			int max = total / 3;
			if ((total % 3) != 0)
				max += 1;

			if (max >= p)
			{
				cnt++;
				continue;
			}

			if (total <= 1)
				continue;

			if (((total % 3) != 1) && (strange > 0) && (max == p - 1))
			{
				cnt++;
				strange--;
			}
		}
		return cnt;
	}

	public static void main(String[] args) throws IOException
	{
		final long start = System.currentTimeMillis();

//		PrintWriter writer = new PrintWriter(new BufferedWriter(new FileWriter("taskB.out")));
//		BufferedReader reader = new BufferedReader(new FileReader("taskB.in"));

		PrintWriter writer = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt0.out")));
		BufferedReader reader = new BufferedReader(new FileReader("B-small-attempt0.in"));

		String inLine;
		int caseIndex = 0;
		inLine = reader.readLine();
		while (null != (inLine = reader.readLine()))
		{
			StringTokenizer st = new StringTokenizer(inLine);
			final int n = Integer.parseInt(st.nextToken());
			final int s = Integer.parseInt(st.nextToken());
			final int p = Integer.parseInt(st.nextToken());
			int[] marks = new int[n];
			for (int i = 0; i < n; i++)
				marks[i] = Integer.parseInt(st.nextToken());
			caseIndex++;
			int cnt = calc(p, s, marks);
			writer.printf("Case #%d: %d\r\n", caseIndex, cnt);
		}

		writer.close();


		final long finish = System.currentTimeMillis();
		final long dur = finish - start;
		System.err.println(dur);
	}
}
