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

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Reverser {

	private static int getMaxNormalCase(int score) {
		return (int) Math.ceil((double) score / 3);
	}

	private static int getMaxSurprisingCase(int score) {
		if (score >= 2 && score <= 28) {
			return (int) Math.round((double) score / 3) + 1;
		} else {
			return 0;
		}
	}

	public static void main(String[] args) {
		BufferedReader br;
		try {
			br = new BufferedReader(new InputStreamReader(new DataInputStream(
					new FileInputStream("B-small-attempt3.in"))));
			FileOutputStream fos = new FileOutputStream("output3.txt", true);
			Integer inputSize = Integer.parseInt(br.readLine());
			for (int i = 1; i <= inputSize; i++) {
				String line = br.readLine();
				int tallerOrEqualCounter = 0;
				/*
				 * 0 = N = amount of googlers 1 = S = number of surprisings 2 =
				 * p = reference till end ... score of each googler
				 */
				String[] splittedLine = line.split(" ");
				int surprisingCounter = Integer.parseInt(splittedLine[1]);
				int referenceVal = Integer.parseInt(splittedLine[2]);

				for (int n = 0; n < Integer.parseInt(splittedLine[0]); n++) {
					int playerNScore = Integer.parseInt(splittedLine[3 + n]);
					if (getMaxNormalCase(playerNScore) >= referenceVal) {
						tallerOrEqualCounter++;
					} else if (surprisingCounter > 0
							&& getMaxSurprisingCase(playerNScore) >= referenceVal) {
						tallerOrEqualCounter++;
						surprisingCounter--;
					}
				}

				ArrayList<Integer> usedPlayers = new ArrayList<Integer>();

				if (surprisingCounter > 0) {
					for (int n = 0; n < Integer.parseInt(splittedLine[0]); n++) {
						int playerNScore = Integer
								.parseInt(splittedLine[3 + n]);
						if (getMaxNormalCase(playerNScore) >= referenceVal
								&& getMaxSurprisingCase(playerNScore) >= referenceVal) {
							surprisingCounter--;
							usedPlayers.add(n);
						}
					}
				}

				if (surprisingCounter > 0) {
					for (int n = 0; n < Integer.parseInt(splittedLine[0]); n++) {
						int playerNScore = Integer
								.parseInt(splittedLine[3 + n]);
						if (getMaxNormalCase(playerNScore) < referenceVal
								&& getMaxNormalCase(playerNScore) < referenceVal) {
							surprisingCounter--;
						}
					}
				}

				if (surprisingCounter > 0) {
					for (int n = 0; n < Integer.parseInt(splittedLine[0]); n++) {
						int playerNScore = Integer
								.parseInt(splittedLine[3 + n]);
						if (getMaxNormalCase(playerNScore) >= referenceVal
								&& !usedPlayers.contains(n)
								&& playerNScore >= 2 && playerNScore <= 28) {
							tallerOrEqualCounter--;
							surprisingCounter--;
						}
					}
				}

				String output = "Case #" + i + ": " + tallerOrEqualCounter
						+ "\n";
				fos.write(output.getBytes());
			}
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}
