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 CodeJam12B {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        for (int zz = 1; zz <= T; zz++) {
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();

            int[] t = new int[N];
            int out = 0;

            for (int i = 0; i < N; i++) {
                t[i] = in.nextInt();
                t[i] = t[i] - p;
                if (t[i] >= 0) {
                    if (t[i] >= 2 * (p - 1)) {
                        out++;
                    } else if (t[i] >= 2 * (p - 2) && S > 0) {
                        S--;
                        out++;
                    }
                }
            }
            System.out.format("Case #%d: %d\n", zz, out);
        }
    }
}
