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 Scanner in = new Scanner(System.in);

	int solve() {
		int N = in.nextInt();
		int S = in.nextInt();
		int p = in.nextInt();
		
		int yesLimit = p + 2 * Math.max(0, p-1);
		int maybeLimit = p + 2 * Math.max(0, p-2);
		
		int yes = 0;
		int maybe = 0;

		for (int i=0; i<N; ++i) {
			int totalPoints = in.nextInt();
			if (totalPoints >= yesLimit) {
				++yes;
			} else if (totalPoints >= maybeLimit) {
				++maybe;
			}
		}
		
		return yes + Math.min(S, maybe);
	}
	
	
	public static void main(String[] args) {
		int T = in.nextInt();
		for (int i=1; i<=T; ++i) {
			int ans = new B().solve();
			System.out.println("Case #" + i + ": " + ans);
		}

	}

}
