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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.util.ArrayList;


public class DWG {
	public static void main(String[] args) {
		Integer caseNum = 0;
		/*if(args.length == 0) {
			return;
		}
		caseNum = Integer.parseInt(args[0]);*/
		ArrayList<String> argList = new ArrayList<String>();
		
		String line=null;
		File inputFile = new File("DWGData.txt");
		BufferedReader reader;
		try {
			reader = new BufferedReader(new FileReader(inputFile));
			while ((line=reader.readLine()) != null) {
				argList.add(line);
			}
		} catch (Exception e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		caseNum = Integer.parseInt(argList.get(0));
		
		for(int caseIndex=0; caseIndex < caseNum.intValue(); caseIndex++) {
			String input = argList.get(caseIndex+1);
			System.out.println("Case #" + (caseIndex+1) + ": " + countGooglers(input));
		}
	}
	
	private static int countGooglers(String input) {
		int numOfWiners = 0;
		String[] inputData = input.split(" ");
		if(inputData.length >=4) {
			int numOfGooglers = Integer.parseInt(inputData[0]);
			int numOfSurprise = Integer.parseInt(inputData[1]);
			int score = Integer.parseInt(inputData[2]);
			
			int minWithSurprise = ((score > 2) ? (score-2) : 0)*2 + score;
			int minWithoutSurprise = ((score > 1) ? (score-1) : 0)*2 + score;
			
			if((inputData.length-3) == numOfGooglers) {
				int[] scoreOfGooglers = new int[numOfGooglers];
				for(int i=0; i < numOfGooglers; i++) {
					scoreOfGooglers[i] = Integer.parseInt(inputData[i+3]);
					if(scoreOfGooglers[i] >= minWithoutSurprise) {
						numOfWiners++;
					}else if(scoreOfGooglers[i] >= minWithSurprise) {
						if(numOfSurprise > 0) {
							numOfWiners++;
							numOfSurprise--;
						}
					}
				}
				
			}
		}
		
		return numOfWiners;
	}
}
