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;
	}
}


package codejam2;

import java.io.*;
import java.util.Hashtable;
import java.util.logging.Level;
import java.util.logging.Logger;

class FileReader
{
    int T;
    FileInputStream fstream;
    DataInputStream in;
    BufferedReader br;
    FileReader()
    {
        try
        {
            fstream = new FileInputStream("B-small-attempt0.in");
            in = new DataInputStream(fstream);
            br = new BufferedReader(new InputStreamReader(in));
            initializeT();
        }
        catch (Exception e)
        {
            System.err.println("Error: " + e.getMessage());
        }
    }
    private void initializeT()
    {
        String strLine;
        try 
        {
            strLine = br.readLine();
            T=Integer.parseInt(strLine);
        } 
        catch (IOException ex) 
        {
            Logger.getLogger(FileReader.class.getName()).log(Level.SEVERE, null, ex);
        }
        
    }
    public int getT()
    {
        return T;
    }
    public String getNextLine()
    {
        String temp=null;
        try 
        {
            temp=br.readLine();
        } 
        catch (IOException ex) 
        {
            Logger.getLogger(FileReader.class.getName()).log(Level.SEVERE, null, ex);
        }
        return temp;
    }
}



public class CodeJam2 
{

    public int findGooglers(int N,int S,int p,int[] scores)
    {
        int count=0;
        for(int i=0;i<N;i++)
        {
            int temp=3*p-scores[i];
            if(temp<=2)
                ++count;
            else
            {
                if(S>0)
                {
                    if(temp<=4)
                    {
                        if(scores[i]!=0)
                        {
                            ++count;
                            --S;
                        }
                        
                    }
                }
                
            }       
        }
        return count;
    }
    
    public static void main(String[] args) 
    {
        FileReader fr=new FileReader();
        CodeJam2 cj=new CodeJam2();
        FileWriter fstream;
        try 
        {
            fstream = new FileWriter("output.out");
            BufferedWriter out = new BufferedWriter(fstream);
            int T=fr.getT();
            for(int i=0;i<T;i++)
            {
                String line=fr.getNextLine();
                String buff[]=line.split(" ");
                int N=Integer.parseInt(buff[0]);
                int S=Integer.parseInt(buff[1]);
                int p=Integer.parseInt(buff[2]);
                int arr[]=new int[N];
                for(int j=0;j<N;j++)
                {
                    arr[j]=Integer.parseInt(buff[j+3]);
                }
                out.write("Case #"+(i+1)+": "+cj.findGooglers(N,S,p,arr));
                out.write("\n");
                out.flush();
            }
        }
        catch(Exception ex)
        {

        }
    }
}
    
  