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

public class Dance
{
    public static void main(String zaga[]) throws FileNotFoundException
    {
        Scanner input = new Scanner(System.in);
        File file = new File("out.txt");
        PrintStream writer = new PrintStream(file);
        
        int T = input.nextInt();
        
        ArrayList<Integer> ans = new ArrayList<Integer>();
        
        for(int t = 0; t < T; t++)
        {
            int N = input.nextInt();
            
            int S = input.nextInt();
            
            int P = input.nextInt();
            
            ArrayList<Integer> scores = new ArrayList<Integer>();
            
            for(int i = 0; i < N; i++)
            {
                scores.add(input.nextInt());
            }
            
            int s = 1;
            
            for(int i = 0; i < scores.size(); i++)
            {   
                int num = scores.get(i);
                
                int first = P;
                
                if((scores.get(i) - P) >= P * 2 )
                {
                    continue;
                }
                
                if(scores.get(i) - P < 0)
                {
                    scores.remove(i);
                    --i;
                    continue;
                }
                
                if(((scores.get(i) - P) / 2) + 1 == P)
                {
                    continue;
                }
                
                if(num - P >= 0)
                {
                    int second = (num - P) / 2;
                    int third = second;
                    
                    if((num - P) % 2 == 1)
                    {
                        ++third;
                    }
                
                    if(second + 2 >= P && third + 2 >= P)
                    {
                        if(s <= S)
                        {
                            ++s;
                           continue;
                        }
                        else
                        {
                            scores.remove(i);
                            --i;
                            continue;
                        }
                    }
                    else
                    {
                        scores.remove(i);
                        --i;
                        continue;
                    }
                    
                }
                else
                {
                    scores.remove(i);
                    --i;
                    continue;
                }
            }
            
            ans.add(scores.size());
        }
        
        for(int i = 0; i < ans.size(); i++)
        {
            writer.print("Case #"+(i+1)+": "+ans.get(i));
            
            if(!(i + 1 == ans.size()))
            {
                writer.print("\n");
            }
        }
        
    }
}