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

public class DancingWithTheGooglers{
    public static void main(String[] args) throws Exception{
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        
        int n = Integer.parseInt(in.readLine());
        
        for(int i = 0; i < n; ++i){
            StringTokenizer st = new StringTokenizer(in.readLine());
            int T = Integer.parseInt(st.nextToken());
            int S = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            int[] normal = new int[T];
            int[] surprising = new int[T];
            for(int j = 0; j < T; ++j){
                int sum = Integer.parseInt(st.nextToken());
                if(sum%3 == 2){
                    normal[j] = sum/3+1;
                    if(sum/3+2 <= 10)
                        surprising[j] = sum/3+2;
                    else
                        surprising[j] = sum/3+1;
                }else if(sum%3 == 1){
                    normal[j] = sum/3+1;
                    surprising[j] = sum/3+1;
                }else{
                    normal[j] = sum/3;
                    if(sum/3 - 1 >= 0 && sum/3+1 <= 10)
                        surprising[j] = sum/3+1;
                    else
                        surprising[j] = sum/3;
                }
            }
            int ans = 0;
            for(int j = 0; j < T; ++j){
                if(S > 0 && normal[j] < p && surprising[j] >= p){
                    --S;
                    ++ans;
                }else if(normal[j] >= p){
                    ++ans;
                }
            }
            out.println("Case #"+(i+1)+": "+ans);
        }
        out.close();
    }
}

    