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.*;
import java.util.*;

public class ProblemB
{
	public static void main(String[] args) throws Exception
	{
		final String base = "B-small-attempt2";
		BufferedReader reader = new BufferedReader(new FileReader(base+".in"));
		BufferedWriter writer = new BufferedWriter(new FileWriter(base+".out"));
		reader.readLine();
		int place = 0;
		while (reader.ready())
		{
			String[] strs = reader.readLine().split(" ");
			int[] totals = new int[strs.length-3];
			int surprise = Integer.parseInt(strs[1]);
			int min = Integer.parseInt(strs[2]);
			for (int i=3;i<strs.length;i++)
				totals[i-3]=Integer.parseInt(strs[i]);
			int num = solve(surprise,min,totals);
			writer.write("Case #" + (++place) + ": " + num+'\n');
		}
		writer.close();
		reader.close();
	}

	public static int solve(int surprise, int min, int[] totals)
	{
		int number = 0;
		outer:
		for (int i=0;i<totals.length;i++)
		{
			int total = totals[i];
			boolean sur = false;
			for (int a=0;a<=10;a++)
			{
				for (int b=a;b<=a+2 && b<=10;b++)
				{
					int c = total - a - b;
					if (c<=10 && c>=min && a+2>=c && c>=b)
					{
						if (b==a+2||c==a+2)
							sur=true;
						else
						{
							number++;
							continue outer;
						}
					}
				}
			}
			if (sur && surprise>0)
			{
				number++;
				surprise--;
			}
		}
		return number;
	}

	public static int brute(int surprise, int min, int[] totals)
	{
		int number = 0;
		outer:
		for (int total : totals)
		{
			boolean sur = false;
			for (int a=1;a<=10;a++)
			{
				for (int b=1;b<=10;b++)
				{
					for (int c=1;c<=10;c++)
					{
						if (a+b+c!=total)
							continue;
						int maxDiff = Math.max(Math.abs(a-b), Math.max(Math.abs(a-c), Math.abs(b-c)));
						int max = Math.max(a, Math.max(b,c));
						if (max>=min)
						{
							if (maxDiff<2)
							{
								number++;
								continue outer;
							}
							else if (maxDiff==2)
							{
								sur=true;
							}
						}
					}
				}
			}
			if (sur && surprise>0)
			{
				number++;
				surprise--;
			}
		}
		return number;
	}
}
