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.io.*;
import java.util.*;
public class dancing {
	private void go() throws Exception{
		File infile = new File("B-small-attempt0.in");
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(infile)));
		int num_of_cases = Integer.parseInt(br.readLine());
		for(int i=1;i<=num_of_cases;i++){
			String cur_str = br.readLine();
			StringTokenizer stk = new StringTokenizer(cur_str);
			int num_of_emp = Integer.parseInt(stk.nextToken());
			int num_of_surprise = Integer.parseInt(stk.nextToken());
			int req_num = Integer.parseInt(stk.nextToken());
			int surprise_not_needed = req_num*3 - 2;
			int surprise_needed = Math.max(req_num*3 -2 -2,1);
			int satisifed = 0;
			int scores[] = new int[num_of_emp];
			for(int k=0;k<num_of_emp;k++)
				scores[k] = Integer.parseInt(stk.nextToken());
			for(int k=0;k<num_of_emp;k++){
				if(scores[k] >= surprise_not_needed){
					satisifed++;
					continue;
				}
				else{
					if(scores[k] >= surprise_needed && num_of_surprise>0){
						satisifed++;
						num_of_surprise--;
						continue;
					}
					else continue;
				}
			}
			System.out.println("Case #"+i+": "+satisifed);
		}
	}
	public static void main(String[] args){
		try {
			new dancing().go();
		} catch (Exception ex) {
			ex.printStackTrace();
		}
	}
}
