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


public class Dancers {
	public static void main (String args[]){
		if (args.length != 1){
			System.out.println ("Gimme the right arguments!");
			return;
		}
		File f = new File(args[0]);
		int testcases, surprise, p, n;
		ArrayList <Integer> scores = new ArrayList <Integer>();




		try{
			BufferedReader in = new BufferedReader (new FileReader(f));
			String s;
			testcases = Integer.parseInt(in.readLine());
			for (int i = 1; i<=testcases; i++){

				scores.clear();
				s = in.readLine();
				String temp [] = s.split(" ");
				n= Integer.parseInt (temp[0]);
				surprise = Integer.parseInt(temp[1]);
				p = Integer.parseInt(temp[2]);
				for (int j =3; j<temp.length; j++){
					scores.add(Integer.parseInt(temp[j]));
				}
				int count = 0;
				int countSpecial =0;
				for (int a : scores){
					boolean sp = true;
					boolean found = false;
					for (int q = p; q<=10; q++){
						int t = a - q;
						if(t >=0){
							int l = t/2;
							int h = t - l;
							if (Math.abs(q - l) <=2 && Math.abs(q - h) <=2){
								//	System.out.println(a + " " + + q + " " + t + " " + l + " " + h) ;
								if (Math.abs(q - l) <2 && (Math.abs(q - h) <2)){
									sp = false;	
									//		System.out.println("reg");
								}
								found = true;

							}
						}
					}

					if (found){
						count ++;
						if (sp){
							countSpecial++;
							//	System.out.println("hi");
						}
					}
				}
				//System.out.println(count + " " + countSpecial);
				if (countSpecial > surprise){
					count -= (countSpecial - surprise);
				}
				System.out.printf ("Case #%d: %d\n", i, count );
			}




		}

		catch (IOException e){

		}
	}

}
