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.*;

public class GCJ2Edit{
  
  
  public static void main(String args[])throws Exception{
    
//    Scanner Input = new Scanner(System.in);
    Scanner Input = new Scanner(new File("B-small-attempt3.in"));
    
    int TC = Input.nextInt();
    
    int NG;
    
    int [] Scores;
    int P;
    int Surprise;
    
    int Combos;
    
    for(int i = 0; i<TC; i++){
      
      NG = Input.nextInt();
      
      Scores = new int[NG];
      Surprise = Input.nextInt();
      P = Input.nextInt();
      int count = 0;
      int [] Indi;
      
      for(int j = 0; j<NG; j++){
        
        Scores[j] = Input.nextInt();
        
      }
      
      Indi = new int[3];
      
      for(int j = 0; j<NG; j++){
        
        if(Scores[j]%3 == 0){
          Indi[0] = Scores[j]/3;
          Indi[1] = Scores[j]/3;
          Indi[2] = Scores[j]/3;
        }
        else if(Scores[j]%3 == 1){
          Indi[0] = (Scores[j]/3)+1;
          Indi[1] = (Scores[j]-Indi[0])/2;
          Indi[2] = (Scores[j]-Indi[0])/2;
        }
        else if(Scores[j]%3 == 2){
          Indi[0] = (Scores[j]/3)+1;
          Indi[1] = ((Scores[j]-Indi[0])/2)+1;
          Indi[2] = (Scores[j]-Indi[0])/2;
        }
        
        if(Indi[0]>=P){
          count++;
        }
        
        else{
          if(Scores[j]%3==0){
            Indi[0] = Indi[0]+1;
            Indi[1] = Indi[1]-1;
            if(Indi[0]>=P && Indi[1]>=0){
              if(Surprise == 0){
                if(Math.abs(Indi[0]-Indi[1])<2&&Math.abs(Indi[2]-Indi[1])<2&&Math.abs(Indi[0]-Indi[2])<2)
                  count++;
              }
              else{
                if(Math.abs(Indi[0]-Indi[1])<=2&&Math.abs(Indi[2]-Indi[1])<=2&&Math.abs(Indi[0]-Indi[2])<=2){
                  count++;
                }
              }
            }
            else if (Surprise>0){
              Indi[0] = Indi[0]+1;
              Indi[1] = Indi[1]-1;
              if(Indi[0]>=P && Indi[1]>=0){
                if(Math.abs(Indi[0]-Indi[1])<=2&&Math.abs(Indi[2]-Indi[1])<=2&&Math.abs(Indi[0]-Indi[2])<=2){
                  count++;
                  Surprise--;
                }
              }
            }
          }
          else if(Surprise>0){
            Indi[0] = Indi[0]+1;
            Indi[1] = Indi[1] - 1;
            if(Indi[0]>=P&&Indi[1]>=0){
              if(Math.abs(Indi[0]-Indi[1])<=2&&Math.abs(Indi[2]-Indi[1])<=2&&Math.abs(Indi[0]-Indi[2])<=2){
                count++;
                Surprise--; 
              }
            }
          }
        }
        
        
      }
      System.out.println("Case #" + (i + 1) + ": " + count);
    }
    
  }
  
}