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.FileNotFoundException;
import java.util.HashMap;
import java.util.Map;


public class Jam {
	
	private static String in = "in";
	
	public static void main(String[] args) throws FileNotFoundException, InterruptedException {
		parse(args);
		Parser parser = new Parser(in);
		
		//Map<Thread, Case> tasks = new HashMap<Thread, Case>();
		
		while (parser.hasNext()) {
			Case c = parser.nextCase();
			//Thread task = new Thread(c);
			//task.start();
			//tasks.put(task, c);
			c.run();
			System.out.println(c);
		}
		
		/*for (Thread task : tasks.keySet()) {
			Case c = tasks.get(task);
			task.join();
			System.out.println(c);
		}*/
	}

	private static void parse(String[] args) {
		if (args.length > 0)
			in = args[0];
	}
	
}