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 Triplet implements Comparable<Triplet> {
	
	private int s1;
	private int s2;
	private int s3;
	
	public Triplet(int _s1,int _s2,int _s3){
		s1=_s1;
		s2=_s2;
		s3=_s3;
	}
	
	@Override
	public int compareTo(Triplet o) {
		return new Integer(o.getMax()).compareTo(this.getMax());
	}
	
	public boolean isSurprising(){
		if(Math.abs(s1-s2)==2 || Math.abs(s1-s3)==2 || Math.abs(s2-s3)==2) return true;
		return false;
	}
	
	public int getMax(){
		if(s1>s2 && s1>s3) return s1;
		else if (s2>s3) return s2;
		else return s3;
	}
	
	public void setS1(int s1) {
		this.s1 = s1;
	}
	public int getS1() {
		return s1;
	}
	public void setS2(int s2) {
		this.s2 = s2;
	}
	public int getS2() {
		return s2;
	}
	public void setS3(int s3) {
		this.s3 = s3;
	}
	public int getS3() {
		return s3;
	}
	
	

}
