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.IOException;
import java.util.List;

public class Dancing extends JamProblem {

    public static void main(String[] args) throws IOException {
        Dancing p = new Dancing();
        p.go();
    }

    @Override
    String solveCase(JamCase jamCase) {
        int res = 0;
        DancingCase ca = (DancingCase) jamCase;
        for (int i = 0; i < ca.sums.length; i++) {
            int sum = ca.sums[i];
            if (sum == 0) {
                if (ca.p == 0) {
                    res++;
                }
                continue;
            }
            int n = sum % 3;
            int one = sum / 3;
            if (n == 0) {
                if (one >= ca.p) {
                    res++;
                    continue;
                }
                if (ca.sup > 0) {
                    if (one + 1 >= ca.p) {
                        res++;
                        ca.sup--;
                    }
                }
            }

            if (n == 1) {

                if (one + 1 >= ca.p) {
                    res++;
                }
            }
            if (n == 2) {
                if (one + 1 >= ca.p) {
                    res++;
                    continue;
                }

                if (ca.sup > 0) {
                    if (one + 2 >= ca.p) {
                        res++;
                        ca.sup--;
                    }
                }
            }
        }
        return "" + res;
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        DancingCase ca = new DancingCase();
        ca.lineCount = 1;
        String s = file.get(line);
        List<Integer> integers = JamUtil.parseIntList(s);
        int gs = integers.get(0);
        ca.sup = integers.get(1);
        ca.p = integers.get(2);
        ca.sums = new int[gs];
        for (int i = 0; i < gs; i++) {
            ca.sums[i] = integers.get(3 + i);
        }

        return ca;
    }
}

class DancingCase extends JamCase {
    int p;
    int[] sums;
    int sup;
}