import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

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

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;


public class Dancing {
	
	public static void main(String[] args) throws IOException {
		File file = new File("c:\\java\\DancingResults.txt");
		File inFile = new File("c:\\java\\");
		file.createNewFile();
		PrintStream out = new PrintStream(file);
		Scanner scanIn = new Scanner(inFile);
		
		int T = 0;
		int n = 0;
		int p = 0;
		int score = 0;
		
		int s = 0;
		int total = 0;
		
		T = scanIn.nextInt();//number of cases
		
		for(int i = 0; i < T; i++, total = 0){
			n = scanIn.nextInt();//Number of dancers in case
			s = scanIn.nextInt();//number of surprising scores
			p = scanIn.nextInt();//score to be obtained
			for(int j = 0; j < n; j++){
				score = scanIn.nextInt();
				
				if(p == 0){
					total++;
					continue;
				}
				
				if(score >= minPossible1(p)){
					total++;
				}
				else if(score >= minPossible2(p) && s>0){
					total++;
					s--;
				}
				
			}//End of n loop
			
			out.println("Case #"+(i+1)+": "+total);
			
		}//End of Case-loop
	}
	
	public static int minPossible1(int pt){
		if((pt*3)-2 <= 0) return 1;
		
		return (pt*3)-2;
	}
	
	public static int minPossible2(int pt){
		if((pt*3)-4 <= 0) return 1;
		
		return (pt*3)-4;
	}

}
