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.*;

class ProbB {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		StringBuilder out = new StringBuilder();
		int numCases = in.nextInt();
		for(int count = 1; count <= numCases; ++count) {
			out.append("Case #" + count + ": ");
			int n = in.nextInt();
			int numSurp = in.nextInt();
			int p = in.nextInt();
			int ans = 0;
			int possible = 0;
			int num = 0;
			for(int i = 0; i < n; ++i) {
				num = in.nextInt();
				if(num < p) {
					continue;
				}
				num = num - p;
				num = num / 2;
				if(num >= p-1) {
					++ans;
				}
				else if(num >= p-2) {
					if(numSurp > 0) {
						++ans;
						--numSurp;
					}
				}
				else {
					continue;
				}
			}
			out.append(ans + "\n");
		}
		System.out.println(out);
	}
}