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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;

public class Dancing {

	public static int findmax(int N, int S, int p, ArrayList<Integer> googlers){
		int legit = 0;
		int surprise = 0;
		for(int g : googlers){
			if ( g >= (3*p) - 2){
				legit++;
			}
			else if(g > 0 && g >= (3*p) - 4){
				surprise++;
			}
		}
		return legit + Math.min(S, surprise);
	}//Dancing.findmax()


	public static void main(String[] args) throws IOException{

		String inputFile = args[0];
		String outputFile = args[1];
		File file = new File(inputFile);
		BufferedReader reader = new BufferedReader(new FileReader(file));
		BufferedWriter writer = new BufferedWriter(new FileWriter(outputFile));
		
		int numCases = Integer.parseInt(reader.readLine());
		
		for (int i = 1; i <= numCases; i++){
			int caseNumber = i;
			String[] arguments = reader.readLine().split(" ");
			int N = Integer.parseInt(arguments[0]);
			int S = Integer.parseInt(arguments[1]);
			int p = Integer.parseInt(arguments[2]);
			ArrayList<Integer> googlers = new ArrayList<Integer>();
			for(int j = 0; j < N; j++){
				googlers.add(Integer.parseInt(arguments[j+3]));
			}
			
			writer.write("Case #" + caseNumber + ": " + Dancing.findmax(N,S,p,googlers));
			writer.newLine();
		}
		reader.close();
		writer.close();
	}//Dancing.main()
}//Dancing
