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;
   }
}
/**
 * Copyright 2012 Christopher Schmitz. All Rights Reserved.
 */

package com.isotopeent.codejam.lib.converters;

import com.isotopeent.codejam.lib.InputConverter;

public class DynamicMultiLineConverter implements InputConverter<Object[]> {

	private static final int MAX_PARAM_COUNT = 10;

	private IntArrayLine paramConverter;
	private InputConverter<?> converter;

	private Object[] input;
	private int lineNumber;

	public DynamicMultiLineConverter(InputConverter<?> lineConverter) {
		this(lineConverter, 0);
	}

	public DynamicMultiLineConverter(InputConverter<?> lineConverter, int paramCount) {
		this.converter = lineConverter;
		if (paramCount > 0) {
			paramConverter = new IntArrayLine(paramCount);
		} else {
			paramConverter = new IntArrayLine(new int[MAX_PARAM_COUNT]);
		}
	}

	@Override
	public boolean readLine(String data) {
		if (lineNumber == 0) {
			paramConverter.readLine(data);
			int[] params = paramConverter.generateObject();
			int count = getCount(params);
			input = new Object[count + 1];
			input[lineNumber++] = params;
		} else {
			if (!converter.readLine(data)) {
				input[lineNumber++] = converter.generateObject();
			}
		}

		if (lineNumber >= input.length){
			lineNumber = 0;
		}
		return lineNumber == 0;
	}

	@Override
	public Object[] generateObject() {
		return input;
	}

	/**
	 * default implementation, just uses first parameter value
	 */
	protected int getCount(int[] parameters) {
		return parameters[0];
	}

}
