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

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int k = 1; k<=T; k++){
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			
			int[] t=new int[n];
			
			for (int i =0; i<n; i++) t[i]=in.nextInt();
			Arrays.sort(t);
			
			int comp =0;
			
			for (int i = n-1; i>=0; i--){
				if (t[i]<p) {
					continue;
				}
				if (t[i]>=3*p-2) {
					comp++;
					continue;
				}
				if (s>0 && t[i]>=3*p-4){
					s--;
					comp++;
					continue;
				}
			break;	
			}
			System.out.println("Case #"+k+": "+comp);
		}

	}

}
