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 {
    public static void main(String[] args) throws FileNotFoundException {
        Scanner scanner = new Scanner(new File("B-small-attempt0.in"));
        PrintWriter printer = new PrintWriter(new File("a.out"));
        int t = scanner.nextInt();
        for (int i = 0; i < t; i++) {
            int n = scanner.nextInt();
            int s = scanner.nextInt();
            int p = scanner.nextInt();
            int ans = 0;
            for (int j = 0; j < n; j++) {
                int tmp = scanner.nextInt();
                if (tmp >= p + 2 * Math.max(p - 1, 0)) {
                    ans++;
                } else if (s > 0 && tmp >= p + 2 * Math.max(p - 2, 0)) {
                    ans++;
                    s--;
                }
            }
            printer.println("Case #" + (i + 1) + ": " + ans);
        }
        printer.flush();
        printer.close();
    }
}
