package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}
import java.util.*;
import java.io.*;
public class b{
	public static int[] nums;
	public static int[][] memo;
	public static int p;
	public static void main(String[] args) throws IOException{
		Scanner br = new Scanner(new File("b.in"));
		PrintWriter out = new PrintWriter(new File("b.out"));
		int cases = br.nextInt();
		for(int c = 0;c<cases;c++){
			int n = br.nextInt();
			int 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 i = 0;i<n;i++){
				Arrays.fill(memo[i], -1);
			}
			out.println("Case #"+(c+1)+": "+go(0, s));
		}
		out.close();
	}
	public static int go(int pos, int left){
		if(pos == nums.length){
			return 0;
		}
		if(left < 0){
			return -100000;
		}
		if(memo[pos][left] != -1){
			return memo[pos][left];
		}
		int best = 0;
		for(int i = 0;i<11;i++){
			for(int j = i;j<11;j++){
				int k = (nums[pos]-i)-j;
				if(k < j){
					continue;
				}
				if(k-i > 2){
					continue;
				}
				if(k-i == 2 && left > 0){
					best = Math.max(best, go(pos+1, left-1)+ (k >= p ? 1 : 0));
				}
				else if(k-i < 2){
					best = Math.max(best, go(pos+1, left)+ (k >= p ? 1 : 0));
				}
			}
		}
		return memo[pos][left] = best;
		
	}
}
