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;
   }
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package a;

import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;
import java.io.IOException;

/**
 *
 * @author KazakhPride
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        // TODO code application logic here
        Scanner in = new Scanner(new File("B-small-attempt0.in"));
        PrintWriter out = new PrintWriter(new File("output.txt"));

        int n = in.nextInt();
        int t = 0;
        int s = 0;
        int p = 0;
        
        for (int j = 1; j <= n; j++) {
            out.print("Case #" + j + ": ");
            t = in.nextInt();
            s = in.nextInt();
            p = in.nextInt();
            int count = 0;
            int ar[] = new int[t];
            for (int i = 0; i < ar.length; i++) {
                ar[i] = in.nextInt();
            }
            
            for( int i = 0; i < ar.length; i++ ){
                if(ar[i]%3 == 0){
                    int base = ar[i]/3;
                    //int second = first;
                    //int third = second;
                    if(base >= p){
                        count++;
                    }
                    else{
                        if(s > 0 && base > 0 && base + 1 >= p){
                            count++;
                            s--;
                        }
                    }
                }
                else if(ar[i]%3==1){
                    int base = ar[i]/3;
                    
                    if(base >= p || base + 1 >= p){
                        count++;
                    }
                    else{
                        if(s > 0 && base + 1 >= p){
                            count++;
                            s--;
                        }
                    }
                }
                if( ar[i]%3 == 2 ){
                    int base = ar[i]/3;
                    
                    if(base + 1 >= p || base >= p){
                        count++;
                    }
                    else{
                        if( s > 0 && base + 2 >= p ){
                            count++;
                            s--;
                        }
                    }
                }
            }
            out.println(count);
        }
        in.close();
        out.close();
    }
}