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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;

public class DancingWithTheGooglersSmall {

	public static void main(String[] args) {

		File file = new File("/Users/NoK/Desktop/B-small-attempt1.in");
		int counter = 1;

		try {
			Scanner sc = new Scanner(file);

			int numOfCases = sc.nextInt();

			sc.nextLine();

			for (int i = 0; i < numOfCases; i++) {
				int numOfGooglers = sc.nextInt();
				int numOfSupTrip = sc.nextInt();
				int bestScores = sc.nextInt();
				int maxBestGooglers = 0;

				for (int j = 0; j < numOfGooglers; j++) {
					int googlerPoint = sc.nextInt();
					if (googlerPoint == 0) {
						if (bestScores == 0) {
							maxBestGooglers++;
						}
						continue;
					} else if (googlerPoint == 1) {
						if ((bestScores == 0) || (bestScores == 1)) {
							maxBestGooglers++;
						}
						continue;
					} else if (googlerPoint == 2) {
						if ((bestScores == 0) || (bestScores == 1)) {
							maxBestGooglers++;
						} else if (bestScores == 2) {
							if (numOfSupTrip > 0) {
								maxBestGooglers++;
								numOfSupTrip--;
							}
						}
						continue;
					}
					if (googlerPoint % 3 == 0) {
						if (googlerPoint / 3 >= bestScores) {
							maxBestGooglers++;
						} else {
							if (numOfSupTrip > 0) {
								if ((googlerPoint/3)+1 == bestScores) {
									maxBestGooglers++;
									numOfSupTrip--;
								}
							}
						}
					} else if (googlerPoint % 3 == 1) {
						if ((googlerPoint/3)+1 >= bestScores) {
							maxBestGooglers++;
						}
					} else if (googlerPoint % 3 == 2) {
						if ((googlerPoint/3)+1 >= bestScores) {
							maxBestGooglers++;
						} else {
							if (numOfSupTrip > 0) {
								if ((googlerPoint/3)+2 == bestScores) {
									maxBestGooglers++;
									numOfSupTrip--;
								}
							}
						}
					}
				}

				try { 
					FileWriter fw = new FileWriter("/Users/NoK/Desktop/B-small-attempt1.out", true);
					BufferedWriter bw = new BufferedWriter(fw);
					System.out.println("Case #" + counter + ": " + maxBestGooglers);
					bw.write("Case #" + counter + ": " + maxBestGooglers);
					bw.newLine();
					bw.close();
					counter++;
				} catch (Exception e){
					System.err.println("Error: " + e.getMessage());
				}

			}

		} catch (FileNotFoundException e ) {
			e.printStackTrace();
		}

	}

}