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

class googledance {
  public static void main (String [] args) throws IOException {
	  
    BufferedReader f = new BufferedReader(new FileReader("googledance.in"));
    
    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("googledance.out")));
    
    int n = Integer.parseInt(f.readLine());
    
    String[] scores = new String[n];
    int[] answers = new int[n];
    
    for(int i=0; i<n; i++){
    	scores[i] = f.readLine();
    	answers[i] = 0;
    }
    
    for(int i=0; i<n; i++){
    	
        StringTokenizer st = new StringTokenizer(scores[i]);
        
        int numgooglers = Integer.parseInt(st.nextToken());
        int numsurprises = Integer.parseInt(st.nextToken());
        int threshold = Integer.parseInt(st.nextToken());
        
        Integer[] sumscores = new Integer[numgooglers];
        int[][] breakdown = new int[numgooglers][3];
        boolean[] succeeded = new boolean[numgooglers];
        
        for(int j=0; j<numgooglers; j++){
        	
        	sumscores[j] = Integer.parseInt(st.nextToken());
        }
        
        Arrays.sort(sumscores, Collections.reverseOrder()); //sort DESCENDING
        
        for(int j=0; j<numgooglers; j++){
        	
        	//System.out.println();
        	
        	int psum = 0;
        	
        	for(int k=0; k<3; k++){
        		breakdown[j][k] = sumscores[j]/3;
        		psum += sumscores[j]/3;
        	}
        	
        	if (psum!=sumscores[j]){
        		int deviation = psum-sumscores[j];
        		
        		for(int k=0; k<Math.abs(deviation); k++){ //Notice that there will be AT MOST 2 deviations!
        			
        			if(deviation > 0){ //balance out the deviations as closely as possible
        				breakdown[j][k]--;
        			}
        			else{
        				breakdown[j][k]++; //good news, the breakdown is always sorted from inc->dec
        			}
        			
        		}
        		
        	}
        	
        	/*for(int k=0; k<3; k++){
        		System.out.println(breakdown[j][k]);
        	}*/
        	
        }
        
        for(int j=0; j<numgooglers; j++){
        	
        	for(int k=0; k<3; k++){
        		if(!succeeded[j] && breakdown[j][k]>= threshold){
        			answers[i]++;
        			succeeded[j] = true;
        			
        			break;
        		}
        	}
        	
        }
        
        for(int j=0; j<numgooglers; j++){
            	
           if(!succeeded[j] && numsurprises>0){
            		
        	   if((breakdown[j][0]+2-breakdown[j][1] > 2) || (breakdown[j][0]+1>10) || (breakdown[j][1]-1<0)) //greater than 2 is an impossible surprise
        		   continue;
        	   
        	   breakdown[j][1]--;
        	   breakdown[j][0]++;
        	   
        	   numsurprises--;
            }

        }
        
        for(int j=0; j<numgooglers; j++){
        	
        	for(int k=0; k<3; k++){
        		if(!succeeded[j] && breakdown[j][k] >= threshold){
        			answers[i]++;
        			succeeded[j] = true;
        			
        			break;
        		}
        	}
        	
            /*for(int k=0; k<3; k++){
        		System.out.println(breakdown[j][k]);
               }*/
        	
        }

    }
    
    for(int i=0; i<n; i++){
    	out.println("Case #" + (i+1) + ": " + answers[i]);
    }
    
    out.close();                                  
    
    System.exit(0);                             
  }
}
