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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Scanner;


public class GoogleCodeB {
	public static void main(String args[]) throws Exception {
		FileReader fr = new FileReader("C:/Users/moez/Desktop/B-small-attempt1.in");
		BufferedReader br = new BufferedReader(fr);
		FileWriter fstream = new FileWriter("C:/Users/moez/Desktop/out.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		  int l= 1;
		String s;
		
		int N, S, P, X, Y, nsurp, surp, temp;
		int i = 0;
		int[] t = new int[6];
		String[] st = new String [6];
		br.readLine();
		while((s = br.readLine()) != null) {
			Scanner sc = new Scanner(s);
			i = 0;
			N = sc.nextInt();
			S = sc.nextInt();
			P = sc.nextInt();
			X = 3*P-2;
			Y = ((3*P-4 > 0) ? 3*P-4 : P);
			nsurp = surp= 0;
			for (i=0; i<N ;i++){
				temp = sc.nextInt();
				if ( temp >= X){
					nsurp++;
				}else if ( temp >= Y)
					surp++;
			}
			nsurp+=((surp > S) ? S : surp);		
				
		out.write("Case #"+l+": "+nsurp);
		out.write("\r\n");
		
		
		l++;
		}
		out.close();
		fr.close();
		}
}
