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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.List;
import java.util.Scanner;

public class ProblemB {
    public static void main(String[] args) throws IOException {
        BufferedReader consoleIn = new BufferedReader(new InputStreamReader(System.in));
        String line = consoleIn.readLine();
        int T = Integer.valueOf(line);
        for(int i = 0; i < T; i++){
            line = consoleIn.readLine();
            Scanner sc = new Scanner(line);
            int N = sc.nextInt();
            int S = sc.nextInt();
            int P = sc.nextInt();

            int[] scores = new int[N];
            for(int j = 0; j < N; j++){
                scores[j] = sc.nextInt();
            }

            int[] supMax = new int[N];
            int[] norMax = new int[N];
            for(int j = 0; j < N; j++){
                int score = scores[j];
                int res = score % 3;

                supMax[j] = (score - res) / 3 + 1;
                if(res == 2){
                    supMax[j]++;
                }

                norMax[j] = (score - res) / 3 + 1;
                if(res == 0){
                    norMax[j]--;
                }

                if(score == 0 || score == 1 || score == 30 || score == 29 || score == 28){
                    supMax[j] = norMax[j];
                }
            }

            int needSup = 0;
            int nor = 0;
            for(int j = 0; j < N; j++){
                if(norMax[j] >= P){
                    nor++;
                } else if(supMax[j] >= P){
                    needSup++;
                }
            }

            int result;
            if(needSup <= S){
                result = nor + needSup;
            } else {
                result = nor + S;
            }

            StringBuilder sb = new StringBuilder();

            System.out.printf("Case #%d: %d", i+1, result);
            System.out.println(sb.toString());
        }
    }
}
