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.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Dancing {

	public static void main(String[] args) throws IOException {
		if (args.length < 2) {
			System.err
					.println("Please enter the Valid I/O Paths in the argument ");
			System.err.println("First Input , then OutPut ");
			System.exit(0);
		}
		File inFile = new File(args[0]);
		File outFile = new File(args[1]);
		BufferedReader in = new BufferedReader(new InputStreamReader(
				new FileInputStream(inFile)));
		PrintWriter out = new PrintWriter(new FileOutputStream(outFile));
		String myLine = in.readLine();
		int t = Integer.parseInt(myLine);
		int caseNum = 1;
		int n, s, p;
		while (t-- > 0) {
			myLine = in.readLine();
			String[] myStr = myLine.split(" ");
			n = Integer.parseInt(myStr[0]);
			s = Integer.parseInt(myStr[1]);
			p = Integer.parseInt(myStr[2]);

			int[] arr = new int[n];
			int min = (p - 2) * 3 + 2 > 0 ? (p - 2) * 3 + 2 : p;
			int min1 = 3*p - 2;
			int rem2 = 0;
			int normal = 0;
			int result = 0;
			if (p > 0) {
				for (int i = 0; i < arr.length; i++) {
					arr[i] = Integer.parseInt(myStr[i + 3]);
					if (arr[i] >= min && arr[i] < min1)
					rem2++;
					else if (arr[i] >= min1)
						normal++;
				}
				result = normal + (rem2 >= s ? s : rem2);
			} else {
				result = n;
			}
			out.println("Case #" + (caseNum) + ": " + result);
			caseNum++;
		}
		out.close();
	}
}
