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.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

class Dancing {

    public static void main(String args[]) throws IOException {
        Scanner in = new Scanner(new File("dance.txt"));
        PrintWriter fw = new PrintWriter(new FileWriter(new File("dance.out")));
        int cases = in.nextInt();
        for (int c = 1; c <= cases; c++) {
            int N = in.nextInt(); // number of googlers
            int S = in.nextInt(); // number of surprising triplets
            int p = in.nextInt(); // best result
            ArrayList<Integer> scores = new ArrayList<Integer>();
            for (int n = 0; n < N; n++) {
                int googler = in.nextInt();
                scores.add(googler);
            }
            Collections.sort(scores);
            int pass = 0;
            for (int i = 0; i < scores.size(); i++) {
                int score = scores.get(i);
                int mod = score % 3;
                int max = score / 3;
                int low = max;
                if (mod > 0) {
                    max++;
                }
                if (max >= p) {
                    pass++;
                    continue;
                }
                if (S > 0) {
                    if (mod % 2 == 0) {
                        if(mod == 0 && low == 0){
                            continue;
                        }
                        max++;
                        if (max >= p) {
                            pass++;
                            S--;
                            continue;
                        }
                    }
                }

            }// for loop
            String fwout = "Case #" + c + ": " + pass;
            fw.println(fwout);
        }
        fw.close();
    }
}
