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.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;


public class Googlers {
	
	public static void main(String args[]) throws NumberFormatException, IOException
	{
		solve();
	}

	public static void solve() throws NumberFormatException, IOException
	{
		ArrayList<String> array=new ArrayList<String>();
		FileInputStream in = new FileInputStream("B-small-attempt0.in");
		Scanner s = new Scanner(in);
		String solved="";
		int num_cases=s.nextInt();
		int N=0,S=0,p=0;
		int R=0,x=0,y=0,z=0;		
		int count=0;
		
		
		for(int i=0;i<num_cases;i++)
		{
			N=s.nextInt();
			S=s.nextInt();
			p=s.nextInt();
			count=0;
			
			//System.out.println("N:"+N+" S:"+S+" p:"+p);
			//System.out.println("");
			 
			for(int j=0;j<N;j++){
				
				R=s.nextInt();
				for(int d=0;d<5;d++){
					x=(R+d)/3;					
					for(int k=0;k<2;k++)
					{
						z=(2*x-k-d)/2;
						y=z+k;
						if(x+y+z==R && (x>=0 && x<=10) && (y>=0 && y<=10) && (z>=0 && z<=10)){							
							if((x-y==2 || x-z==2 || y-z==2))
							{								
								if(x>=p || y>=p || z>=p){
									//System.out.println("x:"+x+" y:"+y+" z:"+z+" = "+R +"(S)");
									array.add("S"+i+j);
								}
							}else if(!(x-y==2 || x-z==2 || y-z==2)){
								if(x>=p || y>=p || z>=p){
									//System.out.println("x:"+x+" y:"+y+" z:"+z+" = "+R +"(R)");
									array.add("R"+i+j);
								}
							}
						}
					}
				}
			}
			for(int j=0;j<N;j++){
				if(array.contains("R"+i+j))
				{
					count+=(array.remove("R"+i+j) ? 1 : 0);
				}else if(array.contains("S"+i+j)){
					if(count<N && S>0)
					{
						count+=(array.remove("S"+i+j) ? 1 : 0);
						S-=1;
					}else{
						array.remove("S"+i+j);
					}
				}
			}
			
			solved+="Case #"+(i+1)+": "+count+"\n";
			System.out.println("Case #"+(i+1)+": "+count);
		}
		
		s.close();
		in.close();
		
		FileWriter fstream = new FileWriter("sollution.out");
		BufferedWriter out = new BufferedWriter(fstream);
		out.write(solved);
		out.close();
		fstream.close();
	}

}
