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


public class DancingWiththeGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new DancingWiththeGooglers().fun();
	}
	
	private void fun()
	{
		String file = "D:/CodeJam/inputB.in";
		try {
			scan = new Scanner(new File(file));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		int cases = scan.nextInt();
		
		for(int i = 1; i <= cases ; i++)
		{
			int noOfGooglers = findTheResult();
			System.out.println("Case #"+i+": "+noOfGooglers);
		}
	}
	
	private int findTheResult()
	{
		int googlers = scan.nextInt();
		int surprising = scan.nextInt();
		int minScore = scan.nextInt();
		int minValue = getMinValue(minScore);
		int criticValue1 = minValue;
		int criticValue2 = criticValue1 + 1;
		int count = 0;
		int criticalCount = 0;
		for(int i = 0; i< googlers; i++)
		{
			int score = scan.nextInt();
			if(minValue == 0)
			{
				count++;
				continue;
			}
			else if(minValue == 1)
			{
				if(score >= minValue)
					count++;
				continue;
			}
			if(score >= minValue)
			{
				if(score == criticValue1 || score == criticValue2)
				{
					if(criticalCount < surprising)
					{
						count++;
						criticalCount++;
					}
				}
				else
					count++;
			}
		}
		return count;
	}
	
	private int getMinValue(int minScore)
	{
		int value = 0;
		if(minScore > 2)
		{
			value = minScore - 2;
			value = minScore + value*2;
		}
		else
			value = minScore;
		
		return value;
	}
	
	Scanner scan = null;
}
