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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;

public class Dancing {

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

		BufferedReader in = new BufferedReader(new FileReader("dancing.in"));
		PrintWriter out = new PrintWriter(new FileWriter("dancing.out"));

		String lineStr;
		int T, N, S, P, ti, result;

		T = Integer.parseInt(in.readLine());
		System.out.println(T + " test cases");

		for (int line = 1; line <= T; line++) {

			lineStr = in.readLine();
			String[] fields = lineStr.split(" ");
			N = Integer.parseInt(fields[0]);
			S = Integer.parseInt(fields[1]);
			P = Integer.parseInt(fields[2]);

			System.out.println("N=" + N + " S=" + S + " P=" + P);

			result = 0;
			for (int i = 0; i < N; i++) {
				ti = Integer.parseInt(fields[3 + i]);
				if (ti > (3 * (P - 1))) {
					// Guaranteed to have at least P and without surprise
					result++;
				} else if (ti >= 2 && ti <= 28 && ti >= (3 * (P - 1) - 1)) {
					// Have p but with surprise
					if (S > 0) {
						result++;
						// reduce available surprise
						S = S - 1;
					}
				}
			}

			out.println("Case #" + line + ": " + result);
			System.out.println(lineStr + " : " + result);
		}

		in.close();
		out.close();
	}

}
