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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package topcoder;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author ahmet
 */
public class codeJam {
    
    
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
        Scanner scan = new Scanner(System.in);
        
        
        int T = scan.nextInt();
        
        for(int i = 0; i < T; i++)
        {
            ArrayList<Integer> list = new ArrayList<Integer>();
            int howMany = scan.nextInt();
            int S = scan.nextInt();
            int p = scan.nextInt();
            
            for(int ii = 0; ii < howMany; ii++)
            {
                list.add(scan.nextInt());
            }
            Collections.sort(list);
            System.out.println("Case #" + (i + 1) + ": " + analiz(list, S, p));
        }  
    }
    
    public static String analiz( ArrayList <Integer> a, int S, int p)
    {
        int count = 0;
        for(int i = 0; i < a.size(); i++)
        {
            if(a.get(i)/3 >= p)
            {
                 a.set(i, -1);
                 count++;
            }
        }   
        for(int i = 0; i < a.size(); i++)
        {
            if(a.get(i) == -1)
            {
                 a.remove(i);
                 i=0;
            }
        }
        while(S >= 0 && a.size() > 0 && a.get(a.size() - 1 ) > 0)
        {
            if(a.get(a.size() - 1 )%3 == 0 )
            {
                if(a.get(a.size() - 1)/3 + 1 >= p && S != 0)
                {
                    count++;
                    S--;
                }
                else
                    break;
            }
            else if(a.get(a.size() - 1 ) % 3 == 1)
            {
                if(a.get(a.size() - 1)/3 + 1 >= p)
                {
                    count++;
                }
                else
                    break;

            }
            else if(a.get(a.size() - 1 ) % 3 == 2)
            {
                if(a.get(a.size() - 1) /3 + 1 >= p)
                {
                    count++;
                }      
                else if(a.get(a.size() - 1)/3 + 2 >= p && S != 0)
                {
                    count++;
                    S--;
                }
                else
                    break;
            }     
            a.remove(a.size() - 1 );            
        }
        
        return "" + count;
    }
    
}
