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.*;

public class Test2 {

	final static String INPUT_FILE_NAME = "input2";

	int T = 0;
	int q = 0;

	public static void main(String args[]) {
		try {
			Test2 tst = new Test2();
			tst.getInput();
		}
		catch (Exception e) {
			e.printStackTrace();
		}
	}

	private void getInput() throws Exception {
		File file = new File(INPUT_FILE_NAME);
		FileReader fis = new FileReader(file);
		BufferedReader br = new BufferedReader(fis);
		String strT = br.readLine();
		T = getInt(strT);

		for (int i=0; i<T; i++) {
			String strHead = br.readLine();
			String[] strHairetsu = strHead.split(" ");
			int N = getInt(strHairetsu[0]);
			int S = getInt(strHairetsu[1]);
			int P = getInt(strHairetsu[2]);
			int[] t = new int[N];
			for (int j=0; j<N; j++) {
				t[j] = getInt(strHairetsu[3+j]);
			}

			//list kakunou
			execuse(i, N, S, P, t);
		}
	}

	private void execuse(int num, int N, int S, int P,int[] t) {

		int count =0;
		for (int i=0; i<N; i++) {
			int mod3 =t[i] % 3;
			if (mod3==0) {
				if (t[i] == 0) {
					if (P==0) {
						count++;
					}
				} else if (t[i]/3 >= P) {
					count++;
				} else if ((t[i]/3 >= (P-1)) && S>0) {
					S--;
					count++;
				} 
			} else if (mod3 ==2) {
				if (t[i]/3 >= P-1) {
					count++;
				} else if ((t[i]/3 >= (P-2)) && S>0) {
					S--;
					count++;
				} 
			} else {
				if (t[i]/3 >= P-1) {
					count++;
				}
			}
		}


		System.out.println("Case #"+(num+1)+": "+count);
		//System.out.println("Hello WorldI");
	}

	private int getInt(String a) {
		return Integer.parseInt(a, 10);
	}

	private int getIntx(String a) {
		if (a.equals(".")) {
			return 0;
		}
		return 1;
	}

}
