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.*;
import java.util.Arrays;
import java.util.Locale;

/**
 * @author Yuri Denison
 * @date 14.04.12
 */
public class GoogleCodeJamTaskB {
  private static void solve() throws IOException {
    final int t = rInt();
    for (int i = 1; i <= t; i++) {
      final int n = rInt();
      final int s = rInt();
      final int p = rInt();
      int[] results = new int[n];
      for (int j = 0; j < n; j++) {
        results[j] = rInt();
      }
      Arrays.sort(results);

      if (p == 0) {
        out.println(String.format("Case #%d: %d", i, n));
        continue;
      }
      int bestGooglers;
      int count1 = 0;
      int count2 = 0;

      final int limit1 = p + 2 * (p - 1);
      final int limit2 = (p > 1) ? p + 2 * (p - 2) : p;

      for (int j = 0; j < n; j++) {
        if (results[j] >= limit1) {
          count1 = results.length - j;
          break;
        }
      }
      for (int j = 0; j < n; j++) {
        if (results[j] >= limit2) {
          count2 = results.length - j;
          break;
        }
      }
      final int abs = count2 - count1;
      bestGooglers = count1 + ((s < abs) ? s : abs);

      out.println(String.format("Case #%d: %d", i, bestGooglers));
    }
  }

  public static void main(String[] args) throws IOException {
    Locale.setDefault(Locale.US);

    BufferedReader br;
    try {
      final String fileName = "B-small-attempt1";
      br = new BufferedReader(new FileReader(fileName + ".in"));
      out = new PrintWriter(new FileWriter(fileName + ".out"));
    } catch (Exception e) {
      br = new BufferedReader(new InputStreamReader(System.in));
      out = new PrintWriter(new OutputStreamWriter(System.out));
    }
    st = new StreamTokenizer(br);

    solve();

    br.close();
    out.close();
  }

  private static StreamTokenizer st;
  private static PrintWriter out;

  static String rNext() throws IOException {
    st.nextToken();
    return st.sval;
  }

  static int rInt() throws IOException {
    st.nextToken();
    return (int) st.nval;
  }
}
