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


public class code12 {
    public static int nosurprise(int n){
    int p= (n/3);
     if(n%3==0){return p;}else{return (p+1);}}
    public static int surprise(int n){
    int p=(n/3);
    if(n%3==2){return (p+2);}else{
        if(n%3==1){return (p+1);}
        else{if(p-1>0){return (p+1);}else{return p;}}}} 
    
    public static int solution(int x, int[] p,int s){
    int sur=s; int ans=0;
    for(int k=0;k<p.length;k++){
    if(nosurprise(p[k])>=x){ans++;}
    else{
    if(sur>0){if(surprise(p[k])>=x){
    ans++;sur--;}else{}}else{}}
    }
    return ans;}
     public static void main(String[] args) throws IOException{
       Scanner c = new Scanner(System.in);
     int times=c.nextInt();
     for(int p=0;p<times;p++){
     int n=c.nextInt(); int surprise=c.nextInt(); int val=c.nextInt();
     int[] ci=new int[n];
     for(int g=0; g<n;g++){
     ci[g]=c.nextInt();}
     int answer= solution(val,ci,surprise);
     System.out.println("Case #"+(p+1)+":  "+answer);}
     }
}
