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 {
	private int totalScore;
	private int[] scores;
	private boolean isWeird;	// scores of the judge

	public Googler(int totalScore) {
		scores = new int[3];
		this.totalScore = totalScore;
		isWeird = false;
		setMins();
	}

	private void setMins() {
		int copyTotal = this.totalScore;
		int i = 0;	// start at first index
		if (copyTotal == 0) {
			this.scores[0] = 0;
			this.scores[1] = 0;
			this.scores[2] = 0;
		}
		while (copyTotal > 0) {
			this.scores[i] = this.scores[i] + 1;	// index 0 will have highest score
			i = (i + 1) % 3;
			copyTotal--;
		}
	}

	public boolean hasHighScore(int p) {
		int i;
		for (i = 0; i < 3; i++) {
			if (this.scores[i] >= p) {
				return true;
			}
		}
		return false;
	}
	private boolean canBeWeird() {
		if (this.totalScore <= 1 || this.totalScore > 27 || this.totalScore % 3 == 1) {
			return false;
		}
		return true;
	}
	public boolean weirdHighScore(int p) {
		if (canBeWeird() && this.scores[0] + 1 >= p) {
			this.isWeird = true;
			this.scores[0] = this.scores[0] + 1;
			this.scores[1] = this.scores[1] - 1;
			return true;
		} else {
			return false;
		}
	}
	@Override
	public String toString() {
		String s = this.isWeird ? "W" : "";
		s = s + "[" + this.scores[0] + "," + this.scores[1] + "," + this.scores[2] + "] tot=" + this.totalScore;
		return s;
	}
}
