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

public class DancingWithTheGooglers {
  public static void main(String... args) {

    try {
      File f = new File("B-small-attempt0.in");
      File outFile = new File("output.txt");
      FileWriter w = new FileWriter(outFile);
      Scanner s = new Scanner(f);
      int T = s.nextInt();
      s.nextLine();
      for(int i = 1; i<= T; i++) {
        int N = s.nextInt();
        int S = s.nextInt();
        int p = s.nextInt();
        int[] t = new int[N];
        for(int j = 0; j < N; j++) {
          t[j] = s.nextInt();
        }
        int max = findMax(N,S,p,t);
        String line = "Case #" + i +": " + max + '\n';
        System.out.print(line);
        w.write(line);
        if(s.hasNextLine()) s.nextLine();
      }
      w.close();
    }
    catch(Exception e) { }
  }
  private static int findMax(int N, int S, int p, int[] t) {
    int possible = 0;
    int surprising = 0;
    for(int i = 0; i < t.length; i++) {
      if(p == 1) {
        if(t[i] >= 1) {
          possible++;
        }
      }
      else if(t[i] >= (3*p - 2)){
        possible++;
      }
      else if(t[i] >= (3*p - 4)) {
        surprising++;
      }
    }
    return possible + Math.min(surprising, S);
  }
}