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.io.IOException;
import java.util.StringTokenizer;

public class Judging {
	private int cases;

	public Judging() throws IOException {
		cases = Integer.valueOf(getLine());

		run();
	}

	public String getLine() throws IOException {
		String s = "";
		char c;
		while ((c = (char) System.in.read()) != '\n') {
			s += c;
		}
		return s;
	}

	public void run() throws IOException {
		Case curr;
		for (int i = 0; i < cases; i++) {
			curr = new Case(getLine());
			System.out.println("Case #" + (i+1) + ": " + curr.calculateNumBestResult());
		}
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			new Judging();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

}

class Case {
	private int numberOfGooglers;
	private int numberOfSuprisingScores;
	private int bestResult;
	private int[] scores;

	public Case(String line) {
		StringTokenizer tokens = new StringTokenizer(line);

		numberOfGooglers = Integer.valueOf(tokens.nextToken());
		numberOfSuprisingScores = Integer.valueOf(tokens.nextToken());
		bestResult = Integer.valueOf(tokens.nextToken());
		scores = new int[numberOfGooglers];

		for (int i = 0; i < numberOfGooglers; i++) {
			scores[i] = Integer.valueOf(tokens.nextToken());
		}
	}

	public int calculateNumBestResult() {
		int counter = 0;
		if (bestResult >= 2) {
			for (int i = 0; i < scores.length; i++) {
				if (scores[i] - (3*bestResult) >= -2)
					counter++;
				else if (scores[i] - (3*bestResult) >= -4) {
					if (numberOfSuprisingScores > 0) {
						counter++;
						numberOfSuprisingScores--;
					}
				}
			}
		} else if (bestResult == 1) {
			for (int i = 0; i < scores.length; i++) {
				if (scores[i] > 0)
					counter++;
			}
		} else if (bestResult == 0) {
			counter = scores.length;
		} else {
			System.err.println("Error!");
		}
		return counter;
	}

}