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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class Dance {

    Scanner in;
    BufferedWriter out;

    Dance(String input, String output) throws Exception {
        in = new Scanner(new File(input));
        FileWriter fstream = new FileWriter(output);
        out = new BufferedWriter(fstream);
    }
    
    public void solveAll() throws IOException {
        int T = in.nextInt();
        int N, S, P;

        for (int test = 1; test <= T; test++) {
            N = in.nextInt();
            S = in.nextInt();
            P = in.nextInt();
            int[] t = new int[N];
            for(int i = 0; i < N; i++) {
                t[i] = in.nextInt();
            }
            out.write("Case #" + test + ": " + solve(N, S, P, t));
            out.newLine();
        }

    }

    public int solve(int N, int S, int P, int[] t) {
        int count = 0;
        for(int i = 0; i < N; i++) {
            if(t[i] % 3 == 0) {
                if(t[i]/3 >= P) {
                    count++;
                } else {
                    if(S > 0 && t[i] != 0 && t[i]/3 + 1 >= P) {
                        count++;
                        S--;
                    }
                }
            } else if(t[i] % 3 == 1) {
                if(t[i]/3 + 1 >= P) {
                    count ++;
                }
            } else {
                if(t[i]/3 + 1 >= P) {
                    count++;
                } else {
                    if(S > 0 && t[i]/3 + 2 >= P) {
                        count++;
                        S--;
                    }
                }
            }
        }
        return count;
    }

    
    public void close() throws IOException {
        in.close();
        out.close();
    }

    public static void main(String[] args) throws Exception {
        Dance pb = new Dance("input.txt", "output.txt");

        pb.solveAll();

        pb.close();
    }
}
