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


public class DancingWithTheGooglers extends Runner{

	@Override
	public String dealWithCase(String line) {
		String[] splits = line.split(" ", -1);
		int noOfDancers = Integer.parseInt(splits[0]);
		int noOfSurprises = Integer.parseInt(splits[1]);
		int minimumScore = Integer.parseInt(splits[2]);
		int needSurpriseMinimum = minimumScore * 3 - 4;
		int noNeedForSurpriseMinimum = minimumScore * 3 - 2;
		if (minimumScore == 0) {
			needSurpriseMinimum = 0;
			noNeedForSurpriseMinimum = 0;
		} else if (minimumScore == 1) {
			needSurpriseMinimum = 1;
			noNeedForSurpriseMinimum = 1;
		}
		int needSurpriseCount = 0;
		int noNeedForSurpriseCount = 0;
		for (int i=3;i<splits.length;i++) {
			int currentTotal = Integer.parseInt(splits[i]);
			if (currentTotal >= noNeedForSurpriseMinimum) {
				noNeedForSurpriseCount++;
			} else if (currentTotal >= needSurpriseMinimum) {
				needSurpriseCount++;
			}
		}
		int result = noNeedForSurpriseCount + (noOfSurprises < needSurpriseCount ? noOfSurprises : needSurpriseCount);
		return String.valueOf(result);
	}
	
	public static void main(String[] args) throws Exception {
		DancingWithTheGooglers runner = new DancingWithTheGooglers();
		runner.run(args);
	}

}
