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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class Dancing {
	
	public static void main(String args[]) throws NumberFormatException, IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(in.readLine());
		int t = 0;
		String str = "";
		String regex = " ";
		String[] split;
		String[] result = new String[T+1];
		int N = 0;
		int S = 0;
		int p = 0;
		for(int x = 1; x <= T; x++){
			str = in.readLine();
			split = str.split(regex);
			N = Integer.parseInt(split[0]);
			S = Integer.parseInt(split[1]);
			p = Integer.parseInt(split[2]);
			for(int y = 3; y < (3 + N); y++ ) {
				if(bestScore(N, S, p, Integer.parseInt(split[y])) == 1) {
					t++;
				}
				if(bestScore(N, S, p, Integer.parseInt(split[y])) == 2) {
					S--;
					t++;
				}
			}
			
			result[x] = "Case #" + x + ": " + t;
			t=0;
		}
		for(int u = 1; u <= T; u++){
			System.out.println(result[u]);
		}
		
	}
	
	public static int bestScore (int N, int S, int p, int t){
		int work = 0;
		int temp = t;
		int score;
		int special = 2;
		if(S != 0){
			for(score = 10; score > 0; score--){
				
				if(t - score >= (score - special)*(2) && (t-score > 0)) {
					temp = score;
					score = -1;
				}
			}
			if(temp >= p)
			{
				work = 2;
				
			}
		}
		temp = t;
		special = 1;
		for(score = 10; score >= 0; score--){
		
			if(t - score >= (score - special)*(2) && (t-score > 0)) {
				temp = score;
				score = -1;
			}
		}
		if(temp >= p)
		{
			work = 1;
			
		}
		return work;
		
	}

}
