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


public class GooglersDancing {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int noCases = in.nextInt();
		
		for(int i = 0; i < noCases; i++){
			int noGooglers = in.nextInt();
			int noSuprises = in.nextInt();
			int minBestResult = in.nextInt();
			ArrayList<Integer> scores = new ArrayList<Integer>();
			ArrayList<Integer> possibleSurprises = new ArrayList<Integer>();
			for(int j = 0; j < noGooglers; j++){
				scores.add(in.nextInt());
				possibleSurprises.add(0);
			}
			int counter = 0;
			for(int j = 0; j < noGooglers; j++){
				int score = scores.get(j);
				int others = score - minBestResult;
				if(others < 0){
					possibleSurprises.set(j,-2);
					continue;
				}
				if(score < 2){
					possibleSurprises.set(j,-1);
					if(score == 0 && minBestResult == 0){
						counter++;
						continue;
					}
					if(score == 1 && (minBestResult <= 1)){
						counter++;
						continue;
					}
					continue;
				}
				if(score > 28){
					possibleSurprises.set(j,-1);
					counter++;
					continue;
				}
				if(Math.ceil(others / 2) < (minBestResult - 2)){
					possibleSurprises.set(j,-2);
					continue;
				}
				counter++;
				if((others >= minBestResult*2-2) && (others <= minBestResult*2+2)){
					possibleSurprises.set(j,1); //maybe surprise
				}
				else {
					boolean foundMaybe = false;
					for(int k = minBestResult+1; k <= 10; k++){
						others = score - k;
						if((others >= k*2-2) && (others <= k*2+2)){
							possibleSurprises.set(j,1); //maybe surprise
							foundMaybe = true;
							break;
						}
					}
					if(!foundMaybe){
						possibleSurprises.set(j,2); // must be surprise
					}
				}
			}
			
			int must = 0;
			int maybe = 0;
			int noes = 0;
			for(Integer surp : possibleSurprises){
				if(surp.intValue() == 1){
					maybe++;
				}
				if(surp.intValue() == 2){
					must++;
				}
				if(surp.intValue() == -1){
					noes++;
				}
			}
			if(must > noSuprises){
				System.out.println("Case #"+(i+1)+": " + (noSuprises+maybe+noes));
			}
			else{
				System.out.println("Case #"+(i+1)+": " + counter);
			}
		}
	}

}
