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.awt.image.BufferStrategy;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class DancingGooglers {
	public static void main(String[] args) {
		File file  = new File("C:\\Users\\aadi\\Desktop\\DancingGooglers\\B-small-attempt0.in");
		try{
			FileWriter fstream = new FileWriter("C:\\Users\\aadi\\Desktop\\DancingGooglers\\out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
		    Scanner scanner = new Scanner(file);
		    int numOfCases = Integer.parseInt(scanner.nextLine());
		    for(int i =0 ;i< numOfCases ; i++){
		    	int sCount= 0;
		    	int non_sCount = 0;
		    	String line = scanner.nextLine();
		    	Scanner scanner2 = new Scanner(line);
		    	scanner2.useDelimiter(" ");
		    	int n =  scanner2.nextInt();
		    	int s =  scanner2.nextInt();
		    	int p =  scanner2.nextInt();
		    	while(scanner2.hasNext()){
		    		int tot = scanner2.nextInt();
		    		if(tot>=Math.max((p*3-2), 0)){
		    			non_sCount++;
		    		}else if(tot>=(p + Math.max((p-2),0) + Math.max((p-2),0)) ){
		    			sCount++;
		    		}
		    	}
		    	out.write("Case #"+(i+1)+": ");
		    	if(sCount<s){
	    			//System.out.println(non_sCount+sCount);
	    			out.write(""+(non_sCount+sCount));
	    		}else{
	    			//System.out.println(non_sCount+s);
	    			out.write(""+(non_sCount+s));
	    		}
		    	//System.out.println("");
		    	out.write(System.getProperty("line.separator"));
		    }
		    out.close();
		}catch(FileNotFoundException f){
			f.printStackTrace();
		}catch(Exception e){
			e.printStackTrace();
		}
	}

}
