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.*;

class Googlers
{
	public static void main(String args[]) throws IOException
	{
		FileInputStream fstream = new FileInputStream("B-small-attempt0.in");
		DataInputStream dstream = new DataInputStream(fstream);
		BufferedReader br = new BufferedReader(new InputStreamReader(dstream));
		FileWriter fw = new FileWriter("output.txt");
		BufferedWriter out = new BufferedWriter(fw);
		int lines = Integer.parseInt(br.readLine());		//lines LINES OF INPUT TO FOLLOW
		for(int j=0;j<lines;j++)                        //EACH LINE FROM SECOND LINE
		{
			int googlers,S,P,result=0,number;
			String strLine;
			if ((strLine = br.readLine()) != null)
			{
				
				out.write("Case #"+(j+1)+": ");
				String str[] = strLine.split(" ");
				googlers=Integer.parseInt(str[0]);
				S=Integer.parseInt(str[1]);
				P=Integer.parseInt(str[2]);
				for(int i=3;i<(googlers+3);i++)
				{
					number = Integer.parseInt(str[i]);
					int divider = number/3;
					int remainder = number%3;
					if((remainder==0) && ((number!=0) || (P==0)))
					{
						if(divider>=P)
							result++;
						else if((P==(divider+1)) && (S!=0))
						{
							result++;
							S--;
						}
					}
					else if(remainder==1)
					{
						if(divider+1>=P)
							result++;
					}
					else if(remainder==2)
					{
						if(divider+1>=P)
							result++;
						else if((P==(divider+2)) && (S!=0))
						{
							result++;
							S--;
						}
					}
					
				}
				out.write(""+result);
		    }
			out.newLine();
		}
		dstream.close();
		out.close();
	}
}