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.util.Scanner;

public class B2 {

  /**
   * @param args
   */
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int nbrCases = sc.nextInt();
    for (int i = 1; i <= nbrCases; ++i) {
      sc.nextLine();
      System.out.print("Case #" + i + ": ");

      int nbrGooglers = sc.nextInt();
      int nbrSurprising = sc.nextInt();
      int atLeast = sc.nextInt();

      // The lowest value of a triplet which isn't surprising with
      // at least N is a triplet with the values N, N-1 and N-1
      int lowestNonSurprisingSum = 3 * atLeast - 2;
      // The lowest value of a triplet which is surprising with
      // at least N is a triplet with the values N, N-2 and N-2
      int lowestSurprisingSum = 3 * atLeast - 4;
      // Base cases
      if (atLeast == 0) {
        lowestNonSurprisingSum = 0;
        lowestSurprisingSum = 0;
      } else if (atLeast == 1) {
        lowestNonSurprisingSum = 1;
        lowestSurprisingSum = 1;
      }

      int nbrNonSurprisingFound = 0;
      int nbrSurprisingFound = 0;
      for (int j = 0; j < nbrGooglers; ++j) {
        int score = sc.nextInt();
        if (score >= lowestNonSurprisingSum) {
          ++nbrNonSurprisingFound;
        } else if (score >= lowestSurprisingSum) {
          ++nbrSurprisingFound;
        }
      }

      int max = nbrNonSurprisingFound + Math.min(nbrSurprisingFound, nbrSurprising);
      System.out.println(max);
    }
  }
}
