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.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.List;
import java.util.Map;


public class Drugi {

	public static void main (String [] args) throws IOException {
		
		 PrintWriter out2 = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
		 Input in= new Input(new FileInputStream(new File("B-small.in")));
		 //BufferedReader in = new BufferedReader(new FileReader("Asmall.in"));
		 
		 
		 int t= in.readInt();
		 int n,s,p,zbroj,irr, m;
		 	
		 for(int i=0; i<t;i++)
		 {	
			n = in.readInt();
			s = in.readInt();
			p = in.readInt();
			zbroj = 0;
			irr = 0;
			for(int j=0; j<n;j++)
			{
				m = in.readInt();
				if(p==0) zbroj++;
				else if(p==1) 
				{
					if(m!=0) zbroj++;
				}
				else if(m>=3*p-2) zbroj++;
				else if(m>=3*p-4) irr++;
			}
			 zbroj += min(irr,s);
			 out2.print("Case #"); 	     
		     out2.print(i+1);
		     out2.print(": ");
		     out2.println(zbroj);
		     out2.flush();
		 }
	}

	private static int min(int irr, int s) {
		if(irr>s) return s;
		return irr;
	}
}
