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.Arrays;
import java.util.Scanner;


public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for(int tc = 1 ; tc <= T ; tc++ ) {
			int N = reader.nextInt();
			int S = reader.nextInt();
			int p = reader.nextInt();
			int [] arr = new int[N];
			for(int i = 0 ; i < N ; i ++) {
				arr[i] = reader.nextInt();
			}
			int res = doit(arr, S, p);
			System.out.printf("Case #%d: %d\n", tc, res);
		}
	}

	private static int doit(int[] arr, int s, int p) {
		int n = arr.length;
		Triplet[] ts = new Triplet[n];
		for(int i = 0 ; i < n ; i ++) {
			ts[i] = new Triplet(arr[i]);
		}
		Arrays.sort(ts);
		int count = 0;
		for(int i = 0 ; i < arr.length; i ++) {
			if ( ts[i].max >= p) {
				count ++;
//				System.out.println(ts[i].total + " used");
				continue;
			}
			if( s > 0 && ts[i].surprisingMax >= p) {
				s--;
				count ++;
//				System.out.println(ts[i].total + " used");
				continue;
			}
//			System.out.println(ts[i].total + "  " + s + p);
		}
		return count;
	}
}

class Triplet implements Comparable<Triplet> {
	int total;
	int max;
	int surprisingMax;
	public Triplet(int total) {
		this.total = total;
		initialize();
	}
	private void initialize() {
		int avg = total / 3;
		int remaining = total % 3;
		int a[] = new int[3];
		a[0] = avg;
		a[1] = avg;
		a[2] = avg;
		if(remaining > 0) {
			a[0]++;
		}
		if(remaining > 1) {
			a[1]++;
		}
		this.max = a[0];
		switch(remaining) {
		case 0:
		case 2:
			this.surprisingMax = a[0] + (a[1] > 0 ? 1 : 0);
			break;
		case 1:
			this.surprisingMax = -1;
			break;
		}
//		System.out.println("total: " + total + " max: " + max + " remaining: " + remaining + " surp max: " + surprisingMax);
	}
	@Override
	public int compareTo(Triplet o) {
		if(o.total != total) {
			return o.total - total;
		}
		if(o.max != max) {
			return o.max - max;
		}
		return o.surprisingMax - surprisingMax;
	}
}
