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


public class Dwtg {
	List<List<List<String>>> input;
	
	public Dwtg(List<List<List<String>>> input){
		this.input = input;
	}
	
	public void solve(){
		int googlers;
		int surprise;
		int p;
		int res;
		
		int scoreOk;
		int nbOk;
		int potentialSurp;
		int nbSurp;
		for(int i = 0; i < input.size(); i++){
			googlers = Integer.parseInt(input.get(i).get(0).get(0));
			surprise = Integer.parseInt(input.get(i).get(0).get(1));
			p = Integer.parseInt(input.get(i).get(0).get(2));
			res = 0;
			scoreOk = p*3;
			
			nbOk = 0;
			potentialSurp = 0;
			nbSurp = 0;
			if(p == 0){
				System.out.println("Case #" + (i+1) + ": " + googlers);
			}
			else{
				for(int x = 3; x < googlers + 3; x++){
					int score = Integer.parseInt(input.get(i).get(0).get(x));
					if( (score > 0) && (score >= (scoreOk - 2)) ){
						nbOk++;
					}
					else if( (score > 0) && (score >= (scoreOk - 4)) ){
						potentialSurp++;
					}
				}
				nbSurp = Math.min(potentialSurp, surprise);
				res = nbOk + nbSurp;
				System.out.println("Case #" + (i+1) + ": " + res);
			}
		}
	}
}
