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.HashMap;
import java.util.Map;
import java.util.Scanner;


public class QuestionA extends Question{

	private static Map<Character, Character> translationMap;
	private static boolean isInit;
	private StringBuilder sb;
	
	public QuestionA(Result result, Counter counter)
	{
		super(result, counter);
		if (!isInit) {
			init();
			isInit=true;
		}
	}
	
	private void init() {
		translationMap = new HashMap<Character, Character>();
		String text = "zyeq"+"ejp mysljylc kd kxveddknmc re jsicpdrysi"+"rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd"+"de kr kd eoya kw aej tysr re ujdr lkgc jv";
		String translation = "qaoz"+"our language is impossible to understand"+"there are twenty six factorial possibilities"+"so it is okay if you want to just give up";
		for (int i = 0; i < text.length(); i++) {
			if (!translationMap.containsKey(text.charAt(i)))
				translationMap.put(text.charAt(i), translation.charAt(i));
		}
	}

	@Override
	public void readInput(Scanner scanner) {
		sb = new StringBuilder();
		sb.append(scanner.nextLine());
	}
	
	@Override
	public String solution() {
		for (int i = 0; i < sb.length(); i++) {
			sb.setCharAt(i, translationMap.get(sb.charAt(i)));
		}
		return sb.toString();
	}


}
