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.util.ArrayList;
import java.util.ArrayList;
import java.io.*;
import java.util.Scanner;
public class Dance {
	
	public static int lowScore(int a) {
		return a/3;
	}

	public static int mediumScore(int a) {
		if (a%3==0)
			return a/3;
		else
			return a/3 + 1;
	}

	public static int surprisingScore(int a) {
		if (a == 0) return 0;
		if (a == 1) return 1;
		if (a == 2) return 2;
		if (a%3 == 0)
			return a/3 + 1;
		else
			return a/3+2;
	}


	public static int maxAbove(ArrayList<Integer> l, int S, int p) {
		int aboveP = 0;
		for (Integer a : l) {
			if (lowScore(a) >= p) {
				aboveP++;
				//System.out.println(a + "low");
			} else if (mediumScore(a) >= p) {
				aboveP++;
				//System.out.println(a + "med");
			} else if (surprisingScore(a) >= p && S > 0) {
				aboveP++;
				S--;
				//System.out.println(a+"surprise");
			}
		}
		return aboveP;
	}

	public static void main(String[] args) throws Exception{
		/*ArrayList<Integer> l = new ArrayList<Integer>();
		l.add(29);
		l.add(20);
		l.add(8);
		l.add(18);
		l.add(18);
		l.add(21);
		System.out.println(maxAbove(l, 2, 8));*/


		Scanner in = new Scanner(new File(args[0]));
		int tests = in.nextInt();
		for (int i = 1 ; i <= tests; i++) {
			int googlers = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			ArrayList<Integer> nums = new ArrayList<Integer>();
			for (int j = 0; j < googlers; j ++ ) {
				nums.add(in.nextInt());
			}
			System.out.println("Case #" + i + ": " + maxAbove(nums, S, p));
		}

		//int[] m = new int[] {15}
	}

}