package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}


import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class B {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException
	{
		Scanner scan = new Scanner(new File("B-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new File("out.txt"));

		int cases = scan.nextInt();
		for (int r = 1; r <= cases; r++)
		{
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();

			int ok = 3 * p - 2;
			int sur = Math.max(3 * p - 4, 1);

			int ret = 0;
			int ss = 0;
			for (int i = 0; i < n; i++)
			{
				int a = scan.nextInt();
				if (a >= ok)
					ret++;
				else if (a >= sur)
					ss++;
			}

			out.println("Case #" + r + ": " + (ret + Math.min(s, ss)));
		}

		out.close();
		scan.close();
	}

}
