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.*;
import java.util.*;

class Triplet
{
	public static void main (String [] args) throws IOException 
	{
		BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt0.out")));
		
		StringTokenizer st = new StringTokenizer(in.readLine());
		int numCases = Integer.parseInt(st.nextToken());
		
		for (int i = 0; i < numCases; i++)
		{
			out.print("Case #" + (i+1) + ": ");
			
			st = new StringTokenizer(in.readLine());
			
			int n = Integer.parseInt(st.nextToken());
			int numSurprisings = Integer.parseInt(st.nextToken());
			int P = Integer.parseInt(st.nextToken());
			
			int min = 0;
			int minNoSurprising = 0;
			
			if (P > 1)
			{
				min = 3*P - 4;
				minNoSurprising = 3*P - 2;
			}
			else if (P == 1)
			{
				min = 1;
				minNoSurprising = 1;
			}
			else
			{
				min = 0;
				minNoSurprising = 0;
			}
			
			int[] totalPoint = new int[n];
			
			for (int j = 0; j < n; j++)
			{
				totalPoint[j] = Integer.parseInt(st.nextToken());
			}
			
			int maxCandidateWithNoSurprisings = 0;
			int maxCandidateWithSurprisings = 0;
			
			for (int j = 0; j < n; j++)
			{
				if (totalPoint[j] >= minNoSurprising)
				{
					maxCandidateWithNoSurprisings++;
				}
				else if (totalPoint[j] >= min)
				{
					maxCandidateWithSurprisings++;
				}
			}
			
			if (maxCandidateWithSurprisings <= numSurprisings)
			{
				out.print((maxCandidateWithNoSurprisings + maxCandidateWithSurprisings));
			}
			else
			{
				out.print((maxCandidateWithNoSurprisings + numSurprisings));
			}
			
			out.println();
		}
		
		out.close();
	}
}