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.*;

public class ProbB {
	
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in).useDelimiter("\n");
		
		int t = s.nextInt();
		String[] lines = new String[t];
		
		for(int i = 0; i < t; i++) {
			lines[i] = s.next();
		}
		
		s.close();
		
		for(int i = 0; i < t; i++) {
			//System.out.println(lines[i]);
			System.out.println("Case #" + (i+1) + ": " + solve(lines[i]));
		}
	}
	
	private static int solve(String ln) {
		Scanner s2 = new Scanner(ln);
		
		int n = s2.nextInt(); // Number of Googlers
		int s = s2.nextInt(); // Number of surprising cases
		int p = s2.nextInt(); // result of at least p?
		int[] tPoints = new int[n]; // array of each Googler's total points
		
		for(int i = 0; i < n; i++) {
			tPoints[i] = s2.nextInt();
			//System.out.println(tPoints[i]);
		}
		
		s2.close();
		
		int total = 0;
		int firstChk = Math.max(3*p - 2, p);
		int scdChk = Math.max(3*p - 4, p);
		
		for(int i = 0; i < n; i++) {
			
			if(tPoints[i] >= firstChk) {
				total++;
				continue;
			}
			else if((tPoints[i] >= scdChk) && (s > 0)) {
				total++;
				s--;
				continue;
			}
		}
		
		return total;
	}

}
