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

public class Googler implements Comparable<Googler> {
	int score1;
	int score2;
	int score3;
	int total;
	int id;
	int modulus;
	int added;
	
	public Googler(int id,int totalArg){
		this.id = id;
		total = totalArg;
		score1=score2=score3=total/3;
		modulus = total%3;
		if(modulus>0){
			score1++;
			modulus--;
		}
		if(modulus>0){
			score2++;
			modulus--;
		}
		added =0;
	}
	
	public boolean passes(int base){
		if(score1 >= base || score2 >= base || score3 >= base)
			return true;
		return false;
	}

	public void modify(){
		if(total>1 ){
			if(score1 == score2){
				score1++;
				score2--;
				added=1;
			}
		}
	}
	@Override
	public int compareTo(Googler arg0) {
		if(this.score1<arg0.score1){
			return 1;
		}else if(this.score1==arg0.score1){
			return 0;
		}else
			return -1;
	}
	
	public String toString(){
		return "id "+id +" scores " +score1 + " "+ score2 + " " + score3 +" total "+total+"\n"; 
		
	}
	
	public boolean checkState(){
		if(score1-score2>2){
			return false;
		}
		
		if(score1-score3>2){
			return false;
			
		}
		if(score2-score3>2){
			return false;
		}
		return true;
	}
}
