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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;


public class Dancing
{
	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		try {
			FileReader fs = new FileReader("/tmp/dancing.in");
			BufferedReader in = new BufferedReader(fs);
			FileWriter fso = new FileWriter("/tmp/dancing.out");
			BufferedWriter out = new BufferedWriter(fso);

			String strLine;
			int i=0;
			int matches;

			while ((strLine = in.readLine()) != null)
			{
				if (i > 0) {
					// parse input line
					String[] strings = strLine.split(" ");
					final int[] ints = new int[strings.length];
					for (int j = 0; j < strings.length; j++) {
						ints[j] = Integer.parseInt(strings[j]);
					}

					matches = findMatches(ints[1], ints[2], Arrays.copyOfRange(ints, 3, 3+ints[0]));

					out.write(new StringBuilder("Case #").append(i)
							.append(": ").append(matches).append("\n")
							.toString());
				}
				i++;
			}

			in.close();
			out.close();
		} catch (Exception e) {// Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}

	private static int findMatches(int surprises, int bestResult, int[] ts)
	{
		int matches = 0;

		List<Integer> totalScores = new ArrayList<Integer>(ts.length);
		for (int index = 0; index < ts.length; index++){
			totalScores.add(ts[index]);
	    }
		Collections.sort(totalScores, Collections.reverseOrder());
		System.out.print("Surprises: " + surprises + " Best: " + bestResult + " Scores: " + totalScores);

		for (int totalScore : totalScores)
		{
			int min = totalScore / 3;
			int delta = totalScore % 3;
			int max = min + delta;

			System.out.print(" [Min: " + min + " / Max: " + max + "]");

			if ((max == bestResult) && (delta == 2) && (surprises > 0)) {
				matches++;
				surprises--;
			} else if ((min + 1 == bestResult) && (max + 1 == bestResult) && (min > 0) && (surprises > 0)) {
				matches++;
				surprises--;
			} else if ((min + 1 >= bestResult) && (max >= bestResult)) {
				matches++;
			}
		}

		System.out.println(" Result: " + matches);
		return matches;
	}
}