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

public class Triple
{
	private int X;
	private int Y;
	private int Z;

	public Triple()
	{
		this.X = 0;
		this.Y = 0;
		this.Z = 0;
	}

	public Triple(int x, int y, int z)
	{
		this.X = x;
		this.Y = y;
		this.Z = z;
	}

	public Triple(int total)
	{
		this.X = total / 3;
		this.Y = (total - this.X) / 2;
		this.Z = (total - this.X - this.Y);
	}

	public Boolean isValid()
	{
		if (Math.abs(this.X - this.Y) > 2)
		{
			return false;
		}
		if (Math.abs(this.X - this.Z) > 2)
		{
			return false;
		}
		if (Math.abs(this.Y - this.Z) > 2)
		{
			return false;
		}

		return true;
	}

	// A result of "True" indicates that a Triple is valid but unusual. "False"
	// could indicate invalid, or valid but not unusual (it's up to you to
	// discriminate)
	public Boolean isUnusual()
	{
		if (!this.isValid())
		{
			return false;
		}
		if (Math.abs(this.X - this.Y) > 1)
		{
			return true;
		}
		if (Math.abs(this.X - this.Z) > 1)
		{
			return true;
		}
		if (Math.abs(this.Y - this.Z) > 1)
		{
			return true;
		}

		return false;
	}

	public Boolean isHigher(int p)
	{
		Boolean high = false;
		if (this.X >= p)
		{
			high = true;
		}
		if (this.Y >= p)
		{
			high = true;
		}
		if (this.Z >= p)
		{
			high = true;
		}

		return high;
	}

	// A false response indicates either the Triple is already higher, or can't
	// be made higher without invalidating
	public Boolean couldBeHigher(int p)
	{
		Boolean high = false;
		if (this.isHigher(p))
		{
			return false;
		}
		
		if ((this.X == p - 1) && (this.X > 0))
		{
			high = true;
		}
		if ((this.Y == p - 1) && (this.Y > 0))
		{
			high = true;
		}
		if ((this.Z == p - 1) && (this.Z > 0))
		{
			high = true;
		}

		return high;
	}

	public void Unusify()
	{
		int highest = Math.max(this.X, Math.max(this.Y, this.Z));
		int lowest = Math.min(this.X, Math.min(this.Y, this.Z));
		if (this.X == highest)
		{
			this.X += 1;
			if (this.Y == lowest)
			{
				this.Z -= 1;
			} else
			{
				this.Y -= 1;
			}
		} else if (this.Y == highest)
		{
			this.Y += 1;
			if (this.X == lowest)
			{
				this.Z -= 1;
			} else
			{
				this.X -= 1;
			}
		} else
		// this.Z == highest
		{
			this.Z += 1;
			if (this.Y == lowest)
			{
				this.X -= 1;
			} else
			{
				this.Y -= 1;
			}
		}
	}

	@Override
	public String toString()
	{
		return "(" + this.X + ", " + this.Y + ", " + this.Z + ")" + (this.isUnusual() ? " is unusual" : "") + (this.isValid() ? "" : " is invalid");
	}

}
