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.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Locale;
import java.util.StringTokenizer;

public class Main {
	FileScanner in;
	PrintWriter out;
	String Filename = "trie";

	public static void main(String[] args) throws Exception {
		new Main().run();
	}

	public void run() throws Exception {
		Locale.setDefault(Locale.US);
		in = new FileScanner("input");
		out = new PrintWriter("output");

		solve();

		out.close();
	}
	
	void solve() throws Exception {
		int n = in.nextInt();
		for (int i = 0; i < n; i++) {
			out.print("Case #" + (i + 1) + ": ");
			int num = in.nextInt();
			int sup = in.nextInt();
			int p = in.nextInt();
			int ans = 0;
			int mayBe = 0;
			for (int j = 0; j < num; j++) {
				int temp = in.nextInt();
				if (temp % 3 == 0) {
					if (temp / 3 >= p) {
						ans++;
						continue;
					}
					if ((temp / 3 + 1 >= p) && (temp / 3 - 1 >= 0)) {
						mayBe++;
						continue;
					}
					continue;
				}
				
				if (temp % 3 == 1) {
					if (temp / 3 + 1 >= p) {
						ans++;
						continue;
					}
					continue;
				}
				
				if (temp % 3 == 2) {
					if (temp / 3 + 1 >= p) {
						ans++;
						continue;
					}
					if ((temp / 3 + 2 >= p) && (temp / 3 + 2 < 11)) {
						mayBe++;
						continue;
					}
					continue;
				}
			}
			ans += Math.min(sup, mayBe);
			out.println(ans);
		}
	}
	
	class FileScanner {
		BufferedReader br;
		StringTokenizer st;

		public FileScanner(String File) throws Exception {
			br = new BufferedReader(new FileReader(File));
		}
		
		String nextLine() throws Exception {
			return br.readLine();
		}

		String next() throws Exception {
			while (st == null || !st.hasMoreTokens()) {
				st = new StringTokenizer(br.readLine());
			}
			return st.nextToken();
		}

		public int nextInt() throws Exception {
			return Integer.parseInt(next());
		}

		public long nextLong() throws Exception {
			return Long.parseLong(next());
		}
	}
}