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.*;
import java.lang.*;
import java.io.*;

class googler
{
    public static void main(String args[])
    {
	try
	{
	    PrintWriter pw=new PrintWriter("out.txt"); 
	    //creating file reader instance and reading first line
	    BufferedReader br=new BufferedReader(new FileReader(args[0]));
	    String line=br.readLine();
	    int T=Integer.parseInt(line); //number of test cases T
	    //-------------------------
	    for(int i=0;i<T;++i)
	    {
		String[] testcase=br.readLine().split(" ");
		int N = Integer.parseInt(testcase[0]);
		int S = Integer.parseInt(testcase[1]);
		int p = Integer.parseInt(testcase[2]);
		if(p==0)
		{
		    //System.out.println("Case #"+(i+1)+": " + N);
		    pw.println("Case #"+(i+1)+": " + N);
		    continue;
		}

		int answer=0;
		for(int j=1;j<=N;++j)
		{
		    int total=Integer.parseInt(testcase[2+j]);
		    if(total==0)
			continue;
		    int x=total/3;
		    //if(x>=p)
		    //{
		    //	answer++;
		    //	continue;
		    //}
		    int modulo=total%3;
		    switch(modulo)
		    {
		    case 0:
			if(x>=p)
			{
			    answer++;
			}
			else if((x+1)>=p && S>0)
			{
			    answer++;
			    S--;
			}
			break;
		    case 1:
			if((x+1)>=p)
			    answer++;
			break;
		    case 2:
			if((x+1)>=p)
			{
			    answer++;
			}
			else if((x+2)>=p && S>0)
			{
			    answer++;
			    S--;
			}
			break;
		    }//end switch
		}

       		//System.out.println("Case #"+(i+1)+": " + answer);

		pw.println("Case #"+(i+1)+": " + answer);
		/*------------------------**/
	    }
	    br.close();
	    pw.close();
	}//end of try
	catch(Exception e)
	{
	    System.out.println("Exception caught: "+e);
	}	
   } 
}