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;
   }
}


///REMOVE ALL OUTPUT AND USE STRINGTOKENIZER!


/*
ID: mfranzs1
LANG: JAVA
TASK: DancingWithTheGooglers
*/
import java.io.*;
import java.util.*;

public class DancingWithTheGooglers {
	static BufferedReader f;
	public static void main (String [] args) throws IOException {
		long unixTime = System.currentTimeMillis();
		// Use BufferedReader rather than RandomAccessFile; it's much faster
		f = new BufferedReader(new FileReader("DancingWithTheGooglers.in"));
	                                                  // input file name goes above
	    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("DancingWithTheGooglers.out")));

	    
	    int lines=Integer.parseInt(f.readLine());
	    
	    for(int i=0;i<lines;i++){
	    	StringTokenizer st = new StringTokenizer(f.readLine()," ");
	    	int bestOfAtLeastP=0;
	    	int numGooglers=Integer.parseInt(st.nextToken());
	    	int suprising=Integer.parseInt(st.nextToken());
	    	int p=Integer.parseInt(st.nextToken());
	    	int suprisingLeft=suprising;
	    	for(int g=0;g<numGooglers;g++){
	    		int total = Integer.parseInt(st.nextToken());
	    		System.out.println(total+" "+Math.ceil(total/3D)+" "+p+" "+((total-p)/2D));
	    		if(Math.ceil(total/3D)>=p){
	    			bestOfAtLeastP++;
	    		}else{
	    			//Has to be suprising
	    			if(total>=p){
		    			if(suprisingLeft>0){
		    				if((total-p)/2D>=p-2){
			    				suprisingLeft--;
			    				bestOfAtLeastP++;
		    				}
		    			}
	    			}
	    		}
	    	}
	    	System.out.println("Case #"+(i+1)+": "+bestOfAtLeastP);
	    	out.println("Case #"+(i+1)+": "+bestOfAtLeastP);
	    }
	    
	    out.close();                                  // close the output file
	    
	    System.out.println("Time elapsed (ms): "+(System.currentTimeMillis()-unixTime));
	    
	    System.exit(0);                               // don't omit this!
	  }
}