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;
    }
}


public class Dancing
{
	public static void main(String[] args)
	{
		int T = StdIn.readInt();

		for (int tr = 1; tr <= T; tr++)
		{
			int N = StdIn.readInt();
			int S = StdIn.readInt();
			int p = StdIn.readInt();

			int numP = 0;
			int numS = 0;

			for (int i = 0; i < N; i++)
			{
				int tripSum = StdIn.readInt();
				int doubSum = tripSum - p;

				if(p == 0)
				{
					numP++;
					continue;
				}


				if (doubSum >= 2*(p-1))
					numP++;
				else if (doubSum >= 2*(p-2) && p > 1)
					numS++;
			}

			int total = numP + Math.min(numS, S);

			StdOut.println("Case #" + tr + ": " + total);
		}
	}
}
