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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.StringTokenizer;

public class Dancing {
	
	static int N, S, p;
	static int[] t;
	
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader("dancing.in"));
		int tc = Integer.parseInt(reader.readLine());
		String line;
		StringTokenizer st;
		for (int c = 1; c <= tc; c++) {
			line = reader.readLine();
			st = new StringTokenizer(line);
			N = Integer.parseInt(st.nextToken());
			S = Integer.parseInt(st.nextToken());
			p = Integer.parseInt(st.nextToken());
			t = new int[N];
			for (int i = 0; i < N; i++) {
				t[i] = Integer.parseInt(st.nextToken());
			}
			System.out.println("Case #"+c+": "+solve());
		}
	}

	static int solve(){
		boolean[] puedeSolo = new boolean[N];
		for (int i = 0; i < N; i++) {
			int k = t[i]/3;
			if (t[i]%3==0 && k>=p) puedeSolo[i]=true;
			if (t[i]%3!=0 && k+1>=p) puedeSolo[i]=true;
		}

		boolean[] puedeSorpresa= new boolean[N];
		for (int i = 0; i < N; i++) {
			int k = t[i]/3;
			if (t[i]%3==2 && k+2>=p) puedeSorpresa[i]=true;
			if (t[i]>=2 && t[i]%3<2 && k+1>=p) puedeSorpresa[i]=true;
		}
		
		int cps = 0;
		for (int i = 0; i < N; i++) {
			if (puedeSolo[i]) cps++;
		}
		
		int cpsor = 0;
		for (int i = 0; i < N; i++) {
			if (!puedeSolo[i] && puedeSorpresa[i]) cpsor++;
		}
		
		return Math.min(cps+cpsor, cps + S);
	}
	
}
