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

/**
 * Created by IntelliJ IDEA.
 * User: Linkov Mikl
 * Date: 15.04.12
 * Time: 2:51
 * To change this template use File | Settings | File Templates.
 */
public class ProblemB {
    public static void main(String [] args) {
        Scanner scanner = new Scanner(System.in);

        int testCount = scanner.nextInt();

        for (int i = 0; i < testCount; i++) {
            int n = scanner.nextInt();
            int s = scanner.nextInt();
            int p = scanner.nextInt();
            int answer = 0;
            for (int j = 0; j < n; j++) {
                int point = scanner.nextInt();
                int flag = 0;
                int max1 = -1;
                int max2 = -1;
                for (int k1 = 0; k1 < 11; k1++) {
                    for (int k2 = 0; k2 < 11; k2++) {
                        for (int k3 = 0; k3 < 11; k3++) {
                            if (k3 + k2 + k1 == point) {
                                if ((Math.abs(k3 - k2) < 3) && (Math.abs(k1 - k2) < 3) && (Math.abs(k3 - k1) < 3)) {

                                    if ((Math.abs(k3 - k2) == 2) || (Math.abs(k2 - k1) == 2) || (Math.abs(k3 - k1) == 2)) {
                                        flag = 1;
                                        max1 = Math.max(k1, max1);
                                        max1 = Math.max(k2, max1);
                                        max1 = Math.max(k3, max1);
                                    } else {
                                        max2 = Math.max(k1, max2);
                                        max2 = Math.max(k2, max2);
                                        max2 = Math.max(k3, max2);
                                    }
                                }
                            }
                        }
                    }
                }

                if (max2 >= p) {
                    answer++;
                } else {
                    if (s > 0) {
                        if (max1 >= p) {
                            answer++;
                            s--;
                        }
                    }
                }
            }
            System.out.println("Case #" + (i + 1) + ": " + answer);
        }
    }
}
