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

import java.util.Scanner;

public class Main_B {
	static int[] results;
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int tests = Integer.valueOf(scan.nextLine());
		results = new int[tests];
		int c = 0;
		while(c < tests)
		{
			solve(scan.nextLine(), c);
			c++;
		}
		//print results
		System.out.println("Output");
		for (int i = 0; i < results.length; i++) {
			System.out.println("Case #" + (i+1) + ": " + results[i]);
		}
		
	}
	//N S P {numbers separated by spaces}
	public static void solve(String s, int on)
	{
		String[] parts = s.split(" ");
		//int num = Integer.valueOf(parts[0]);
		int surp = Integer.valueOf(parts[1]);
		int max = Integer.valueOf(parts[2]);
		int high = 3*max - 2;
		int high_w_surp = 3*max - 4;
		int[] vals = gather(parts);
		int num_pep = 0;
		
		for (int i = 0; i < vals.length; i++) {
			if(vals[i] >= Math.max(high, max))
			{
				num_pep++;
			}
			else if(vals[i] >= Math.max(high_w_surp, max) && surp > 0)
			{
				surp--;
				num_pep++;
			}
		}
		results[on] = num_pep;
		
	}
	
	public static int[] gather(String[] vals)
	{
		int[] nums = new int[vals.length-3];
		for (int i = 0; i < nums.length; i++) {
			nums[i] = Integer.valueOf(vals[i+3]);
		}
		return nums;
	}
}
