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.util.Scanner;

public class B {
    static boolean attainableWithoutSurprises(int best, int total) {
        return best + 2 * Math.max(0, best - 1) <= total;
    }

    static boolean attainableWithSurprises(int best, int total) {
        return best + 2 * Math.max(0, best - 2) <= total;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for (int t = 1; t <= T; ++t) {
            int N = sc.nextInt(), S = sc.nextInt(), p = sc.nextInt(), count = 0;
            for (int i = 0; i < N; ++i) {
                int total = sc.nextInt();
                if (attainableWithoutSurprises(p, total))
                    ++count;
                else if (attainableWithSurprises(p, total) && S-- > 0)
                    ++count;
            }
            System.out.printf("Case #%d: %d\n", t, count);
        }
    }
}
