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;
   }
}
// Dancing With the Googlers

import java.io.*;

public class DancingWithGooglers {
	public static void main(String[] args) throws Exception {
		String inputPath = args[args.length-2];
		String outputPath = args[args.length-1];
		
		BufferedReader br = new BufferedReader(new FileReader(inputPath));
		int numberOfTestCases = Integer.parseInt(br.readLine());
		
		StringBuilder output = new StringBuilder();
		
		for (int i=1; i<=numberOfTestCases; i++) {
			String components[] = br.readLine().split(" ");
			int numberOfDancers = Integer.parseInt(components[0]);
			int numberOfSurprisingResults = Integer.parseInt(components[1]);
			int bestScore = Integer.parseInt(components[2]);
			int numberOfBestScores = 0;
			
			for (int totalScoreIndex=3; totalScoreIndex<(3+numberOfDancers); totalScoreIndex++) {
				int totalScore = Integer.parseInt(components[totalScoreIndex]);
				int average = totalScore / 3;
				int overflow = totalScore % 3;
				
				if (average >= bestScore) {
					numberOfBestScores++;
				} else if ((overflow != 0) && ((average+1) >= bestScore)) {
					numberOfBestScores++;
				} else if (numberOfSurprisingResults != 0) {
					if ((overflow == 2) && ((average+overflow) >= bestScore)) {
						numberOfBestScores++;
						numberOfSurprisingResults--;
					} else if ((overflow == 0) && (average > 0) && ((average+1) >= bestScore)) {
						numberOfBestScores++;
						numberOfSurprisingResults--;
					}
				}
				
//				System.out.println(totalScore + " " + average + " " + overflow + " " + numberOfBestScores);
			}
//			System.out.println("Case #" + i + ": " + numberOfBestScores + "\n");
			output.append("Case #" + i + ": " + numberOfBestScores + "\n");
		}
		
		BufferedWriter bw = new BufferedWriter(new FileWriter(outputPath));
		String outputString = output.toString();
		bw.write(outputString, 0, outputString.length());
		bw.close();
	}
}
