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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class B {
	static PrintWriter out;

	public static void main(String[] args) throws IOException {
		String name = "B-Small";
		Scanner s = new Scanner(new File(name + ".in"));
		int c = s.nextInt();
		out = new PrintWriter(new BufferedWriter(new FileWriter(name + ".out")));
		// out = new PrintWriter(System.out);
		for (int i = 1; i <= c; i++) {
			out.print("Case #" + i + ": ");
			int n = s.nextInt();
			int S = s.nextInt();
			int p = s.nextInt();
			int[] t = new int[n];
			for (int j = 0; j < n; j++) {
				t[j] = s.nextInt();
			}
			int res = solve(n, S, p, t);
			out.print(res);
			out.println();
		}
		out.close();
	}

	static int solve(int n, int s, int p, int[] t) {
		if(p == 0) return n;
		int res = 0;
		for(int i=0; i<n; i++) {
			int b = t[i] / 3;
			int min1=0, max1=0, min2=0, max2=2;
			switch(t[i] % 3) {
			case 0:
				min1 = b;
				max1 = b;
				min2 = b-1;
				max2 = b+1;
				break;
			case 1:
				min1 = b;
				max1 = b+1;
				min2 = b-1;
				max2 = b+1;
				break;
			case 2:
				min1 = b;
				max1 = b+1;
				min2 = b;
				max2 = b+2;
				break;
			}
			if(min2<0) {
				if(max1>=p) {
					res++;
				}
				continue;
			}
			if(max1>=p) {
				res++;
				continue;
			}
			if(max2>=p && s>0) {
				res++;
				s--;
			}
		}
		return res;
	}

}
