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;
   }
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package gcj.base;

import java.util.regex.Pattern;

/**
 *
 * @author jalves
 */
public class ProbB {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new ProbB(args).DoIt();
    }

    Console io;
    private ProbB(String[] args) {
        boolean ovwr = false;
        String in = null;
        String out = null;

        for (int i = 0; i < args.length; i++) {
            if (args[i].startsWith("-i")) {
                in = args[i].substring(2);
                if (in.length() == 0) {
                    in = args[++i];
                }
            } else if (args[i].startsWith("-o")) {
                out = args[i].substring(2);
                if (out.length() == 0) {
                    out = args[++i];
                }
            } if (args[i].equals("-f")) {
                ovwr = true;
            }
        }

        io = new Console(in, out, ovwr);
    }

    private void DoIt()  {
        long startTime, remain;
        long nCases;
        io.logt("Starting...");
        try {
            nCases = io.getLong();
            io.log("There are " + nCases + " cases to process\n");
            startTime = System.currentTimeMillis();
            remain = 20000; // just some value
            for (long i = 1; i <= nCases; i++) {
                io.log("\rProcessing test case " + i + "/" + nCases + " : Remaining " + String.format("%.2fs      ", remain/1000.0));

                DoCase(i);

                remain = (long)((System.currentTimeMillis() - startTime) * ((double)nCases/(double)i - 1));
            }
            io.log("\n");
        } catch (Exception ex) {
            io.logt("\n\nERROR: " + ex);
            throw new RuntimeException("Error while executing main loop", ex);
        }
        io.logt("Done!");
    }

    private void DoCase(long caseNum) throws Exception {
        String input;
        int result;
        
        io.print("Case #" + caseNum + ": ");

        int N = (int)io.getLong();
        int surprising = (int)io.getLong();
        int bestScore = (int)io.getLong();
        
        if (bestScore == 0) {
            result = N;
            for (int i = 0; i < N; i++) {
                io.getLong();
            }
        } else {
            result = 0;
            
            int regularThreshold = bestScore * 3 - 3;
            if (regularThreshold < 0) {
                regularThreshold = 0;
            }
            int surpriseThreshold = regularThreshold - 2;
            if (surpriseThreshold < 1) {
                surpriseThreshold = 1;
            }
            
            int score;
            for (int i = 0; i < N; i++) {
                score = (int)io.getLong();
                if (score > regularThreshold) {
                    result++;
                } else if (score > surpriseThreshold) {
                    if (surprising > 0) {
                        surprising--;
                        result++;
                    }
                }
            }
        }

        io.println(String.valueOf(result));
    }
}
